/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-sets/test_add-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 06:27:50,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 06:27:50,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 06:27:50,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 06:27:50,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 06:27:50,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 06:27:50,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 06:27:50,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 06:27:50,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 06:27:50,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 06:27:50,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 06:27:50,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 06:27:50,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 06:27:50,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 06:27:50,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 06:27:50,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 06:27:50,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 06:27:50,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 06:27:50,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 06:27:50,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 06:27:50,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 06:27:50,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 06:27:50,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 06:27:50,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 06:27:50,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 06:27:50,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 06:27:50,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 06:27:50,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 06:27:50,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 06:27:50,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 06:27:50,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 06:27:50,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 06:27:50,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 06:27:50,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 06:27:50,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 06:27:50,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 06:27:50,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 06:27:50,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 06:27:50,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 06:27:50,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 06:27:50,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 06:27:50,998 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 06:27:51,028 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 06:27:51,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 06:27:51,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 06:27:51,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 06:27:51,031 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 06:27:51,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 06:27:51,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 06:27:51,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 06:27:51,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 06:27:51,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 06:27:51,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 06:27:51,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 06:27:51,033 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 06:27:51,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 06:27:51,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 06:27:51,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 06:27:51,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 06:27:51,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 06:27:51,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 06:27:51,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 06:27:51,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 06:27:51,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 06:27:51,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 06:27:51,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 06:27:51,037 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 06:27:51,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 06:27:51,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 06:27:51,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 06:27:51,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 06:27:51,546 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 06:27:51,547 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 06:27:51,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-2.i [2020-12-23 06:27:51,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac6ba951a/4261692be6394b9d90a22569d526b551/FLAG1f887832f [2020-12-23 06:27:52,434 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 06:27:52,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i [2020-12-23 06:27:52,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac6ba951a/4261692be6394b9d90a22569d526b551/FLAG1f887832f [2020-12-23 06:27:52,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ac6ba951a/4261692be6394b9d90a22569d526b551 [2020-12-23 06:27:52,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 06:27:52,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 06:27:52,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 06:27:52,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 06:27:52,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 06:27:52,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:27:52" (1/1) ... [2020-12-23 06:27:52,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73101bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:52, skipping insertion in model container [2020-12-23 06:27:52,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:27:52" (1/1) ... [2020-12-23 06:27:52,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 06:27:52,827 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~next,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new,],base],StructAccessExpression[IdentifierExpression[~new,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~new,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~prev,],base],StructAccessExpression[IdentifierExpression[~prev,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~next,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~prev,],base],StructAccessExpression[IdentifierExpression[~prev,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~le~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~le~0,],base],StructAccessExpression[IdentifierExpression[~le~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~m~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~m~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~m~1,] left hand side expression in assignment: lhs: VariableLHS[~m~1,] [2020-12-23 06:27:53,314 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i[25793,25806] [2020-12-23 06:27:53,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:27:53,331 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~next,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new,],base],StructAccessExpression[IdentifierExpression[~new,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~new,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~prev,],base],StructAccessExpression[IdentifierExpression[~prev,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~next,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~next,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~prev,],base],StructAccessExpression[IdentifierExpression[~prev,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~le~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~le~0,],base],StructAccessExpression[IdentifierExpression[~le~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~m~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~m~0,] left hand side expression in assignment: lhs: VariableLHS[~n~0,] left hand side expression in assignment: lhs: VariableLHS[~m~1,] left hand side expression in assignment: lhs: VariableLHS[~m~1,] [2020-12-23 06:27:53,491 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-2.i[25793,25806] [2020-12-23 06:27:53,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 06:27:53,590 INFO L208 MainTranslator]: Completed translation [2020-12-23 06:27:53,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53 WrapperNode [2020-12-23 06:27:53,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 06:27:53,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 06:27:53,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 06:27:53,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 06:27:53,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53" (1/1) ... [2020-12-23 06:27:53,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53" (1/1) ... [2020-12-23 06:27:53,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 06:27:53,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 06:27:53,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 06:27:53,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 06:27:53,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53" (1/1) ... [2020-12-23 06:27:53,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53" (1/1) ... [2020-12-23 06:27:53,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53" (1/1) ... [2020-12-23 06:27:53,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53" (1/1) ... [2020-12-23 06:27:53,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53" (1/1) ... [2020-12-23 06:27:53,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53" (1/1) ... [2020-12-23 06:27:53,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53" (1/1) ... [2020-12-23 06:27:53,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 06:27:53,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 06:27:53,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 06:27:53,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 06:27:53,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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-12-23 06:27:53,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 06:27:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 06:27:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 06:27:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 06:27:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 06:27:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 06:27:53,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 06:27:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 06:27:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 06:27:53,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 06:27:54,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 06:27:54,483 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2020-12-23 06:27:54,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:27:54 BoogieIcfgContainer [2020-12-23 06:27:54,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 06:27:54,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 06:27:54,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 06:27:54,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 06:27:54,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 06:27:52" (1/3) ... [2020-12-23 06:27:54,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5963cc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:27:54, skipping insertion in model container [2020-12-23 06:27:54,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:27:53" (2/3) ... [2020-12-23 06:27:54,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5963cc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:27:54, skipping insertion in model container [2020-12-23 06:27:54,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:27:54" (3/3) ... [2020-12-23 06:27:54,497 INFO L111 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2020-12-23 06:27:54,506 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 06:27:54,512 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 06:27:54,539 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 06:27:54,578 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 06:27:54,579 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 06:27:54,579 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 06:27:54,579 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 06:27:54,579 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 06:27:54,579 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 06:27:54,579 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 06:27:54,580 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 06:27:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-12-23 06:27:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 06:27:54,608 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:27:54,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:27:54,610 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:27:54,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:27:54,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1191041087, now seen corresponding path program 1 times [2020-12-23 06:27:54,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:27:54,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417228508] [2020-12-23 06:27:54,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:27:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:27:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:27:54,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417228508] [2020-12-23 06:27:54,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:27:54,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 06:27:54,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261897969] [2020-12-23 06:27:54,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 06:27:54,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:27:54,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 06:27:54,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 06:27:54,885 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2020-12-23 06:27:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:27:54,947 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2020-12-23 06:27:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 06:27:54,949 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-12-23 06:27:54,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:27:54,961 INFO L225 Difference]: With dead ends: 45 [2020-12-23 06:27:54,961 INFO L226 Difference]: Without dead ends: 21 [2020-12-23 06:27:54,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 06:27:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-12-23 06:27:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-12-23 06:27:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-12-23 06:27:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-12-23 06:27:55,016 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2020-12-23 06:27:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:27:55,017 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-12-23 06:27:55,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 06:27:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-12-23 06:27:55,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 06:27:55,018 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:27:55,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:27:55,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 06:27:55,019 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:27:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:27:55,020 INFO L82 PathProgramCache]: Analyzing trace with hash -942277654, now seen corresponding path program 1 times [2020-12-23 06:27:55,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:27:55,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643356532] [2020-12-23 06:27:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:27:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:27:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:27:55,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643356532] [2020-12-23 06:27:55,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:27:55,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 06:27:55,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425692013] [2020-12-23 06:27:55,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 06:27:55,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:27:55,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 06:27:55,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 06:27:55,134 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2020-12-23 06:27:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:27:55,251 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-12-23 06:27:55,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 06:27:55,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-23 06:27:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:27:55,255 INFO L225 Difference]: With dead ends: 41 [2020-12-23 06:27:55,256 INFO L226 Difference]: Without dead ends: 32 [2020-12-23 06:27:55,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:27:55,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-23 06:27:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2020-12-23 06:27:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-12-23 06:27:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-12-23 06:27:55,272 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2020-12-23 06:27:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:27:55,273 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-12-23 06:27:55,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 06:27:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-12-23 06:27:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 06:27:55,274 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:27:55,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:27:55,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 06:27:55,275 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:27:55,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:27:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash 239429152, now seen corresponding path program 1 times [2020-12-23 06:27:55,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:27:55,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112558767] [2020-12-23 06:27:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:27:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:27:55,640 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 14 [2020-12-23 06:27:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:27:55,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112558767] [2020-12-23 06:27:55,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:27:55,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 06:27:55,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976000802] [2020-12-23 06:27:55,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 06:27:55,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:27:55,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 06:27:55,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 06:27:55,647 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2020-12-23 06:27:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:27:55,800 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-12-23 06:27:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 06:27:55,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-23 06:27:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:27:55,802 INFO L225 Difference]: With dead ends: 40 [2020-12-23 06:27:55,802 INFO L226 Difference]: Without dead ends: 19 [2020-12-23 06:27:55,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:27:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-23 06:27:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-12-23 06:27:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-23 06:27:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-12-23 06:27:55,809 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 12 [2020-12-23 06:27:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:27:55,809 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-12-23 06:27:55,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 06:27:55,810 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-12-23 06:27:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:27:55,810 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:27:55,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:27:55,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 06:27:55,811 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:27:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:27:55,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1232200096, now seen corresponding path program 1 times [2020-12-23 06:27:55,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:27:55,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745573452] [2020-12-23 06:27:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:27:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:27:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:27:56,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745573452] [2020-12-23 06:27:56,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:27:56,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 06:27:56,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575998431] [2020-12-23 06:27:56,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 06:27:56,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:27:56,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 06:27:56,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-23 06:27:56,074 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 8 states. [2020-12-23 06:27:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:27:56,368 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-12-23 06:27:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 06:27:56,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-12-23 06:27:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:27:56,370 INFO L225 Difference]: With dead ends: 31 [2020-12-23 06:27:56,370 INFO L226 Difference]: Without dead ends: 26 [2020-12-23 06:27:56,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-12-23 06:27:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-23 06:27:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2020-12-23 06:27:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-23 06:27:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-12-23 06:27:56,377 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2020-12-23 06:27:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:27:56,378 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-12-23 06:27:56,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 06:27:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-12-23 06:27:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 06:27:56,379 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:27:56,379 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:27:56,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 06:27:56,380 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:27:56,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:27:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1233808810, now seen corresponding path program 1 times [2020-12-23 06:27:56,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:27:56,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694647428] [2020-12-23 06:27:56,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:27:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:27:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:27:56,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694647428] [2020-12-23 06:27:56,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:27:56,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 06:27:56,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801397949] [2020-12-23 06:27:56,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 06:27:56,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:27:56,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 06:27:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 06:27:56,450 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2020-12-23 06:27:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:27:56,491 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-12-23 06:27:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 06:27:56,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-23 06:27:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:27:56,493 INFO L225 Difference]: With dead ends: 24 [2020-12-23 06:27:56,493 INFO L226 Difference]: Without dead ends: 20 [2020-12-23 06:27:56,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 06:27:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-23 06:27:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-12-23 06:27:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-23 06:27:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-12-23 06:27:56,500 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2020-12-23 06:27:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:27:56,501 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-12-23 06:27:56,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 06:27:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-12-23 06:27:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 06:27:56,502 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 06:27:56,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 06:27:56,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 06:27:56,502 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 06:27:56,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 06:27:56,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1654632530, now seen corresponding path program 1 times [2020-12-23 06:27:56,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 06:27:56,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517285553] [2020-12-23 06:27:56,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 06:27:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 06:27:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 06:27:57,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517285553] [2020-12-23 06:27:57,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 06:27:57,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 06:27:57,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052191597] [2020-12-23 06:27:57,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 06:27:57,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 06:27:57,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 06:27:57,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 06:27:57,111 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 9 states. [2020-12-23 06:27:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 06:27:57,437 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-12-23 06:27:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 06:27:57,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-12-23 06:27:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 06:27:57,438 INFO L225 Difference]: With dead ends: 21 [2020-12-23 06:27:57,438 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 06:27:57,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-12-23 06:27:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 06:27:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 06:27:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 06:27:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 06:27:57,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-12-23 06:27:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 06:27:57,441 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 06:27:57,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 06:27:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 06:27:57,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 06:27:57,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 06:27:57,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 06:27:57,686 INFO L189 CegarLoopUtils]: For program point L667(line 667) no Hoare annotation was computed. [2020-12-23 06:27:57,686 INFO L189 CegarLoopUtils]: For program point L667-1(line 667) no Hoare annotation was computed. [2020-12-23 06:27:57,686 INFO L189 CegarLoopUtils]: For program point L663(lines 663 668) no Hoare annotation was computed. [2020-12-23 06:27:57,686 INFO L189 CegarLoopUtils]: For program point L564(lines 564 566) no Hoare annotation was computed. [2020-12-23 06:27:57,687 INFO L189 CegarLoopUtils]: For program point L589(lines 589 597) no Hoare annotation was computed. [2020-12-23 06:27:57,687 INFO L192 CegarLoopUtils]: At program point L672(lines 669 673) the Hoare annotation is: true [2020-12-23 06:27:57,687 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 06:27:57,687 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 06:27:57,687 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 06:27:57,688 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2020-12-23 06:27:57,688 INFO L189 CegarLoopUtils]: For program point L565(line 565) no Hoare annotation was computed. [2020-12-23 06:27:57,688 INFO L189 CegarLoopUtils]: For program point L652-2(lines 652 656) no Hoare annotation was computed. [2020-12-23 06:27:57,688 INFO L185 CegarLoopUtils]: At program point L652-3(lines 652 656) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (= |~#s1~0.offset| (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|)) (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base) (= .cse0 ULTIMATE.start_ldv_is_in_set_~s.offset) (= (select |#valid| |~#s1~0.base|) 1) (= |~#s1~0.base| ULTIMATE.start_ldv_is_in_set_~s.base) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= ULTIMATE.start_ldv_set_add_~new ULTIMATE.start_foo_~j~0) (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= |~#s1~0.offset| .cse0) (= |~#s1~0.offset| 0))) [2020-12-23 06:27:57,689 INFO L189 CegarLoopUtils]: For program point L652-4(lines 652 656) no Hoare annotation was computed. [2020-12-23 06:27:57,689 INFO L189 CegarLoopUtils]: For program point L652-7(lines 652 656) no Hoare annotation was computed. [2020-12-23 06:27:57,689 INFO L185 CegarLoopUtils]: At program point L652-8(lines 652 656) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|)) (.cse1 (+ |~#s1~0.offset| 4)) (.cse0 (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (and (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res.base|)) (not (= |~#s1~0.base| .cse0)) (<= .cse1 .cse2) (<= .cse2 .cse1) (= (select |#valid| |~#s1~0.base|) 1) (= (select (select |#memory_int| ULTIMATE.start_ldv_is_in_set_~m~1.base) ULTIMATE.start_ldv_is_in_set_~m~1.offset) ULTIMATE.start_ldv_is_in_set_~e) (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (not (= |~#s1~0.base| ULTIMATE.start_ldv_successful_malloc_~ptr~0.base)) (not (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base)) (= |~#s1~0.offset| 0) (= (select (select |#memory_int| .cse0) |~#s1~0.offset|) ULTIMATE.start_foo_~j~0))) [2020-12-23 06:27:57,689 INFO L189 CegarLoopUtils]: For program point L652-9(lines 652 656) no Hoare annotation was computed. [2020-12-23 06:27:57,690 INFO L185 CegarLoopUtils]: At program point L578(lines 575 579) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= |~#s1~0.offset| (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.base| ULTIMATE.start_ldv_is_in_set_~s.base) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= ULTIMATE.start_ldv_set_add_~new ULTIMATE.start_foo_~j~0) (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= |~#s1~0.offset| 0) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base) (= ULTIMATE.start_ldv_successful_malloc_~ptr~0.offset 0) (= |ULTIMATE.start_ldv_successful_malloc_#res.offset| 0) (= .cse0 ULTIMATE.start_ldv_is_in_set_~s.offset) (= (select |#valid| |~#s1~0.base|) 1) (not (= |~#s1~0.base| ULTIMATE.start_ldv_successful_malloc_~ptr~0.base)) (not (= ULTIMATE.start_ldv_set_add_~s.base |ULTIMATE.start_ldv_successful_malloc_#res.base|)) (= |~#s1~0.offset| .cse0))) [2020-12-23 06:27:57,690 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 06:27:57,690 INFO L189 CegarLoopUtils]: For program point L632(lines 632 639) no Hoare annotation was computed. [2020-12-23 06:27:57,690 INFO L185 CegarLoopUtils]: At program point L657(lines 650 658) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (= |~#s1~0.offset| (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|)) (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base) (= .cse0 ULTIMATE.start_ldv_is_in_set_~s.offset) (= (select |#valid| |~#s1~0.base|) 1) (= |ULTIMATE.start_ldv_is_in_set_#res| 0) (= |~#s1~0.base| ULTIMATE.start_ldv_is_in_set_~s.base) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= ULTIMATE.start_ldv_set_add_~new ULTIMATE.start_foo_~j~0) (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= |~#s1~0.offset| .cse0) (= |~#s1~0.offset| 0))) [2020-12-23 06:27:57,691 INFO L185 CegarLoopUtils]: At program point L657-1(lines 650 658) the Hoare annotation is: (and (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (= |ULTIMATE.start_ldv_is_in_set_#res| 1) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res.base|)) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (= (select |#valid| |~#s1~0.base|) 1) (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (not (= |~#s1~0.base| ULTIMATE.start_ldv_successful_malloc_~ptr~0.base))) [2020-12-23 06:27:57,691 INFO L189 CegarLoopUtils]: For program point L653(lines 653 655) no Hoare annotation was computed. [2020-12-23 06:27:57,691 INFO L189 CegarLoopUtils]: For program point L653-1(lines 653 655) no Hoare annotation was computed. [2020-12-23 06:27:57,691 INFO L189 CegarLoopUtils]: For program point L633(lines 633 638) no Hoare annotation was computed. [2020-12-23 06:27:57,707 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,709 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,709 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,710 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,715 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,716 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,716 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,717 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,719 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,720 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,721 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,723 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,724 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,725 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,728 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,729 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 06:27:57 BoogieIcfgContainer [2020-12-23 06:27:57,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 06:27:57,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 06:27:57,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 06:27:57,736 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 06:27:57,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:27:54" (3/4) ... [2020-12-23 06:27:57,743 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 06:27:57,759 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2020-12-23 06:27:57,759 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-23 06:27:57,760 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 06:27:57,761 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 06:27:57,796 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((s1 == s && s1 == #memory_$Pointer$[s1][s1]) && m == s) && m + 4 == s) && \valid[s1] == 1) && \result == 0) && s1 == s) && s1 == #memory_$Pointer$[s1][s1]) && new == j) && s1 == s) && s1 == m + 4) && s1 == 0 [2020-12-23 06:27:57,798 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((s1 == s && !(s1 == \result)) && !(s1 == #memory_$Pointer$[s1][s1])) && s1 + 4 <= #memory_$Pointer$[s1][s1]) && #memory_$Pointer$[s1][s1] <= s1 + 4) && \valid[s1] == 1) && unknown-#memory_int-unknown[m][m] == e) && s1 == s) && !(s1 == ptr)) && !(m == s)) && s1 == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s1][s1]][s1] == j [2020-12-23 06:27:57,799 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((s1 == #memory_$Pointer$[s1][s1] && s1 == s) && s1 == #memory_$Pointer$[s1][s1]) && new == j) && s1 == s) && s1 == 0) && s1 == s) && m == s) && ptr == 0) && \result == 0) && m + 4 == s) && \valid[s1] == 1) && !(s1 == ptr)) && !(s == \result)) && s1 == m + 4 [2020-12-23 06:27:57,799 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s1 == s && \result == 1) && !(s1 == \result)) && !(s1 == #memory_$Pointer$[s1][s1])) && \valid[s1] == 1) && s1 == s) && !(s1 == ptr) [2020-12-23 06:27:57,859 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-sets/test_add-2.i-witness.graphml [2020-12-23 06:27:57,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 06:27:57,860 INFO L168 Benchmark]: Toolchain (without parser) took 5141.53 ms. Allocated memory was 153.1 MB in the beginning and 205.5 MB in the end (delta: 52.4 MB). Free memory was 107.5 MB in the beginning and 108.2 MB in the end (delta: -686.0 kB). Peak memory consumption was 52.7 MB. Max. memory is 8.0 GB. [2020-12-23 06:27:57,861 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 153.1 MB. Free memory is still 125.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 06:27:57,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 869.68 ms. Allocated memory is still 153.1 MB. Free memory was 107.2 MB in the beginning and 120.7 MB in the end (delta: -13.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2020-12-23 06:27:57,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.73 ms. Allocated memory is still 153.1 MB. Free memory was 120.7 MB in the beginning and 118.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 06:27:57,865 INFO L168 Benchmark]: Boogie Preprocessor took 74.48 ms. Allocated memory is still 153.1 MB. Free memory was 118.6 MB in the beginning and 116.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-23 06:27:57,865 INFO L168 Benchmark]: RCFGBuilder took 737.19 ms. Allocated memory is still 153.1 MB. Free memory was 116.9 MB in the beginning and 93.5 MB in the end (delta: 23.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2020-12-23 06:27:57,866 INFO L168 Benchmark]: TraceAbstraction took 3246.85 ms. Allocated memory was 153.1 MB in the beginning and 205.5 MB in the end (delta: 52.4 MB). Free memory was 92.8 MB in the beginning and 111.8 MB in the end (delta: -19.1 MB). Peak memory consumption was 34.9 MB. Max. memory is 8.0 GB. [2020-12-23 06:27:57,866 INFO L168 Benchmark]: Witness Printer took 123.83 ms. Allocated memory is still 205.5 MB. Free memory was 111.8 MB in the beginning and 108.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 06:27:57,869 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 153.1 MB. Free memory is still 125.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 869.68 ms. Allocated memory is still 153.1 MB. Free memory was 107.2 MB in the beginning and 120.7 MB in the end (delta: -13.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 78.73 ms. Allocated memory is still 153.1 MB. Free memory was 120.7 MB in the beginning and 118.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 74.48 ms. Allocated memory is still 153.1 MB. Free memory was 118.6 MB in the beginning and 116.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 737.19 ms. Allocated memory is still 153.1 MB. Free memory was 116.9 MB in the beginning and 93.5 MB in the end (delta: 23.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3246.85 ms. Allocated memory was 153.1 MB in the beginning and 205.5 MB in the end (delta: 52.4 MB). Free memory was 92.8 MB in the beginning and 111.8 MB in the end (delta: -19.1 MB). Peak memory consumption was 34.9 MB. Max. memory is 8.0 GB. * Witness Printer took 123.83 ms. Allocated memory is still 205.5 MB. Free memory was 111.8 MB in the beginning and 108.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 667]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 652]: Loop Invariant [2020-12-23 06:27:57,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,879 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,879 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,879 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,881 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,881 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,881 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,882 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((s1 == s && !(s1 == \result)) && !(s1 == #memory_$Pointer$[s1][s1])) && s1 + 4 <= #memory_$Pointer$[s1][s1]) && #memory_$Pointer$[s1][s1] <= s1 + 4) && \valid[s1] == 1) && unknown-#memory_int-unknown[m][m] == e) && s1 == s) && !(s1 == ptr)) && !(m == s)) && s1 == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s1][s1]][s1] == j - InvariantResult [Line: 652]: Loop Invariant [2020-12-23 06:27:57,883 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,883 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,884 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((s1 == s && s1 == #memory_$Pointer$[s1][s1]) && m == s) && m + 4 == s) && \valid[s1] == 1) && s1 == s) && s1 == #memory_$Pointer$[s1][s1]) && new == j) && s1 == s) && s1 == m + 4) && s1 == 0 - InvariantResult [Line: 575]: Loop Invariant [2020-12-23 06:27:57,885 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,886 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,887 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,887 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((s1 == #memory_$Pointer$[s1][s1] && s1 == s) && s1 == #memory_$Pointer$[s1][s1]) && new == j) && s1 == s) && s1 == 0) && s1 == s) && m == s) && ptr == 0) && \result == 0) && m + 4 == s) && \valid[s1] == 1) && !(s1 == ptr)) && !(s == \result)) && s1 == m + 4 - InvariantResult [Line: 650]: Loop Invariant [2020-12-23 06:27:57,888 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,889 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,890 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-23 06:27:57,890 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((s1 == s && s1 == #memory_$Pointer$[s1][s1]) && m == s) && m + 4 == s) && \valid[s1] == 1) && \result == 0) && s1 == s) && s1 == #memory_$Pointer$[s1][s1]) && new == j) && s1 == s) && s1 == m + 4) && s1 == 0 - InvariantResult [Line: 650]: Loop Invariant [2020-12-23 06:27:57,891 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-23 06:27:57,892 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((s1 == s && \result == 1) && !(s1 == \result)) && !(s1 == #memory_$Pointer$[s1][s1])) && \valid[s1] == 1) && s1 == s) && !(s1 == ptr) - InvariantResult [Line: 669]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 106 SDtfs, 138 SDslu, 129 SDs, 0 SdLazy, 98 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 264 HoareAnnotationTreeSize, 6 FomulaSimplifications, 34 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 7694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 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...