/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/list-simple/dll2n_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 21:45:16,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 21:45:16,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 21:45:16,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 21:45:16,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 21:45:16,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 21:45:16,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 21:45:16,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 21:45:16,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 21:45:16,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 21:45:16,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 21:45:16,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 21:45:16,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 21:45:16,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 21:45:16,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 21:45:16,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 21:45:16,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 21:45:16,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 21:45:16,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 21:45:16,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 21:45:16,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 21:45:16,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 21:45:16,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 21:45:16,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 21:45:16,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 21:45:16,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 21:45:16,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 21:45:16,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 21:45:16,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 21:45:16,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 21:45:16,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 21:45:16,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 21:45:16,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 21:45:16,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 21:45:16,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 21:45:16,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 21:45:16,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 21:45:16,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 21:45:16,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 21:45:16,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 21:45:16,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 21:45:16,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-02 21:45:16,764 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 21:45:16,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 21:45:16,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 21:45:16,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 21:45:16,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 21:45:16,771 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 21:45:16,771 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-02 21:45:16,771 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-02 21:45:16,771 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-02 21:45:16,771 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-02 21:45:16,772 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-02 21:45:16,772 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-02 21:45:16,772 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-02 21:45:16,772 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-02 21:45:16,772 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-02 21:45:16,772 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-02 21:45:16,772 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-02 21:45:16,773 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-02 21:45:16,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 21:45:16,773 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 21:45:16,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 21:45:16,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 21:45:16,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 21:45:16,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 21:45:16,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 21:45:16,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 21:45:16,774 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 21:45:16,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 21:45:16,774 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 21:45:16,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 21:45:16,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 21:45:16,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 21:45:16,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 21:45:16,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 21:45:16,775 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-02 21:45:16,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 21:45:16,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 21:45:16,775 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-02 21:45:16,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 21:45:16,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 21:45:16,775 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-02 21:45:16,776 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-02 21:45:16,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 21:45:17,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 21:45:17,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 21:45:17,013 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 21:45:17,014 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 21:45:17,014 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2023-04-02 21:45:18,053 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 21:45:18,345 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 21:45:18,346 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2023-04-02 21:45:18,357 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2768d3929/43b9513383344c279679c11b9f1cdf92/FLAG12f04d26f [2023-04-02 21:45:18,371 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2768d3929/43b9513383344c279679c11b9f1cdf92 [2023-04-02 21:45:18,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 21:45:18,374 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 21:45:18,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 21:45:18,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 21:45:18,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 21:45:18,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 09:45:18" (1/1) ... [2023-04-02 21:45:18,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13440be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18, skipping insertion in model container [2023-04-02 21:45:18,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 09:45:18" (1/1) ... [2023-04-02 21:45:18,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 21:45:18,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 21:45:18,647 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i[24706,24719] [2023-04-02 21:45:18,650 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 21:45:18,656 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 21:45:18,704 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i[24706,24719] [2023-04-02 21:45:18,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 21:45:18,731 INFO L208 MainTranslator]: Completed translation [2023-04-02 21:45:18,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18 WrapperNode [2023-04-02 21:45:18,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 21:45:18,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 21:45:18,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 21:45:18,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 21:45:18,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18" (1/1) ... [2023-04-02 21:45:18,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18" (1/1) ... [2023-04-02 21:45:18,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18" (1/1) ... [2023-04-02 21:45:18,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18" (1/1) ... [2023-04-02 21:45:18,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18" (1/1) ... [2023-04-02 21:45:18,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18" (1/1) ... [2023-04-02 21:45:18,773 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18" (1/1) ... [2023-04-02 21:45:18,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18" (1/1) ... [2023-04-02 21:45:18,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 21:45:18,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 21:45:18,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 21:45:18,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 21:45:18,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18" (1/1) ... [2023-04-02 21:45:18,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 21:45:18,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:45:18,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 21:45:18,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 21:45:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 21:45:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 21:45:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 21:45:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-02 21:45:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-02 21:45:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-02 21:45:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-04-02 21:45:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2023-04-02 21:45:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2023-04-02 21:45:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert [2023-04-02 21:45:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 21:45:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 21:45:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 21:45:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 21:45:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 21:45:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 21:45:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 21:45:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-02 21:45:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-02 21:45:18,854 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 21:45:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 21:45:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 21:45:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 21:45:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 21:45:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 21:45:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 21:45:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 21:45:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 21:45:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 21:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 21:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 21:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 21:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 21:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 21:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 21:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 21:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 21:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 21:45:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 21:45:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 21:45:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 21:45:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 21:45:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 21:45:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 21:45:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 21:45:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 21:45:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 21:45:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 21:45:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 21:45:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 21:45:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 21:45:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 21:45:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 21:45:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 21:45:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 21:45:18,859 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 21:45:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 21:45:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 21:45:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 21:45:18,860 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 21:45:18,861 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 21:45:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 21:45:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 21:45:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 21:45:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 21:45:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 21:45:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 21:45:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 21:45:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 21:45:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 21:45:18,862 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 21:45:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 21:45:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 21:45:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 21:45:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 21:45:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 21:45:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 21:45:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 21:45:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 21:45:18,863 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 21:45:18,864 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 21:45:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 21:45:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 21:45:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 21:45:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 21:45:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 21:45:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 21:45:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 21:45:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 21:45:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 21:45:18,865 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 21:45:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 21:45:18,866 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 21:45:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 21:45:18,867 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 21:45:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 21:45:18,868 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-02 21:45:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-04-02 21:45:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 21:45:18,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 21:45:18,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 21:45:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2023-04-02 21:45:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2023-04-02 21:45:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 21:45:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 21:45:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert [2023-04-02 21:45:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 21:45:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-02 21:45:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-04-02 21:45:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 21:45:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 21:45:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 21:45:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 21:45:19,113 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 21:45:19,115 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 21:45:19,183 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-02 21:45:19,321 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 21:45:19,424 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 21:45:19,425 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-04-02 21:45:19,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 09:45:19 BoogieIcfgContainer [2023-04-02 21:45:19,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 21:45:19,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 21:45:19,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 21:45:19,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 21:45:19,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 09:45:18" (1/3) ... [2023-04-02 21:45:19,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59717076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 09:45:19, skipping insertion in model container [2023-04-02 21:45:19,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 09:45:18" (2/3) ... [2023-04-02 21:45:19,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59717076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 09:45:19, skipping insertion in model container [2023-04-02 21:45:19,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 09:45:19" (3/3) ... [2023-04-02 21:45:19,433 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2023-04-02 21:45:19,445 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 21:45:19,446 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 21:45:19,484 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 21:45:19,489 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78337f60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-02 21:45:19,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 21:45:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.36) internal successors, (34), 27 states have internal predecessors, (34), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 21:45:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-02 21:45:19,498 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:45:19,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:45:19,499 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:45:19,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:45:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1354220909, now seen corresponding path program 1 times [2023-04-02 21:45:19,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:45:19,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626773070] [2023-04-02 21:45:19,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:45:19,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:45:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:45:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:45:19,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:45:19,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626773070] [2023-04-02 21:45:19,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626773070] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 21:45:19,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 21:45:19,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 21:45:19,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929213129] [2023-04-02 21:45:19,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 21:45:19,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 21:45:19,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:45:19,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 21:45:19,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 21:45:19,969 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.36) internal successors, (34), 27 states have internal predecessors, (34), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 3 states have (on average 5.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 21:45:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:45:20,469 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2023-04-02 21:45:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 21:45:20,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 5.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2023-04-02 21:45:20,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:45:20,475 INFO L225 Difference]: With dead ends: 75 [2023-04-02 21:45:20,475 INFO L226 Difference]: Without dead ends: 31 [2023-04-02 21:45:20,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-02 21:45:20,480 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 21:45:20,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 128 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 21:45:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-02 21:45:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-04-02 21:45:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 21:45:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-04-02 21:45:20,503 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2023-04-02 21:45:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:45:20,503 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-04-02 21:45:20,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 5.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 21:45:20,504 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-04-02 21:45:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-02 21:45:20,504 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:45:20,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:45:20,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 21:45:20,505 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:45:20,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:45:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1479317610, now seen corresponding path program 1 times [2023-04-02 21:45:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:45:20,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556979123] [2023-04-02 21:45:20,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:45:20,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:45:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:45:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:45:20,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:45:20,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556979123] [2023-04-02 21:45:20,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556979123] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:45:20,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828755634] [2023-04-02 21:45:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:45:20,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:45:20,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:45:20,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:45:20,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 21:45:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:45:20,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 21:45:20,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:45:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:45:21,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:45:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:45:21,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828755634] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:45:21,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1765817301] [2023-04-02 21:45:21,130 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-04-02 21:45:21,130 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:45:21,132 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:45:21,136 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:45:21,136 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:45:21,195 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:45:21,541 INFO L197 IcfgInterpreter]: Interpreting procedure dll_insert with input of size 41 for LOIs [2023-04-02 21:45:21,801 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 39 for LOIs [2023-04-02 21:45:21,822 INFO L197 IcfgInterpreter]: Interpreting procedure dll_create with input of size 44 for LOIs [2023-04-02 21:45:22,021 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:45:22,024 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:45:23,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1765817301] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 21:45:23,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-02 21:45:23,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 31 [2023-04-02 21:45:23,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941323485] [2023-04-02 21:45:23,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 21:45:23,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-02 21:45:23,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:45:23,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-02 21:45:23,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2023-04-02 21:45:23,177 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 21:45:27,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-04-02 21:45:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:45:27,799 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-04-02 21:45:27,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-02 21:45:27,799 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2023-04-02 21:45:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:45:27,800 INFO L225 Difference]: With dead ends: 37 [2023-04-02 21:45:27,800 INFO L226 Difference]: Without dead ends: 30 [2023-04-02 21:45:27,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=288, Invalid=2162, Unknown=0, NotChecked=0, Total=2450 [2023-04-02 21:45:27,802 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-04-02 21:45:27,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 10 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-04-02 21:45:27,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-02 21:45:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-04-02 21:45:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 21:45:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-04-02 21:45:27,809 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 27 [2023-04-02 21:45:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:45:27,809 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-04-02 21:45:27,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 21:45:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-04-02 21:45:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-04-02 21:45:27,810 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:45:27,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 21:45:27,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-02 21:45:28,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:45:28,016 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:45:28,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:45:28,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1740239955, now seen corresponding path program 1 times [2023-04-02 21:45:28,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:45:28,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253049482] [2023-04-02 21:45:28,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:45:28,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:45:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:45:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 21:45:28,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:45:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253049482] [2023-04-02 21:45:28,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253049482] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:45:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856084825] [2023-04-02 21:45:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:45:28,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:45:28,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:45:28,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:45:28,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 21:45:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:45:28,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 21:45:28,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:45:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 21:45:28,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 21:45:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 21:45:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856084825] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 21:45:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [67119420] [2023-04-02 21:45:28,417 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-04-02 21:45:28,417 INFO L166 IcfgInterpreter]: Building call graph [2023-04-02 21:45:28,417 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-02 21:45:28,417 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-02 21:45:28,417 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-02 21:45:28,429 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-02 21:45:28,821 INFO L197 IcfgInterpreter]: Interpreting procedure dll_insert with input of size 41 for LOIs [2023-04-02 21:45:29,056 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 39 for LOIs [2023-04-02 21:45:29,076 INFO L197 IcfgInterpreter]: Interpreting procedure dll_create with input of size 44 for LOIs [2023-04-02 21:45:29,226 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-02 21:45:29,229 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-02 21:45:36,134 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '712#(and (= main_~data~0 1) (<= 1 |#StackHeapBarrier|) (= |main_~#s~0.offset| 0) (= main_~count~0 0) (= main_~ptr~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) 0)) (= main_~len~0 2) (= main_~temp~2.base (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (not (= (select (select |#memory_int| main_~ptr~0.base) main_~ptr~0.offset) 1)) (= |#NULL.offset| 0) (or (not (= main_~ptr~0.offset 0)) (not (= main_~ptr~0.base 0))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) 0) main_~ptr~0.offset) (<= (+ |#StackHeapBarrier| 1) |main_~#s~0.base|) (= (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)) main_~temp~2.offset) (= |#NULL.base| 0))' at error location [2023-04-02 21:45:36,135 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-02 21:45:36,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 21:45:36,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-04-02 21:45:36,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116683800] [2023-04-02 21:45:36,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 21:45:36,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 21:45:36,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-02 21:45:36,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 21:45:36,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2023-04-02 21:45:36,137 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 12 states, 8 states have (on average 4.625) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-02 21:45:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 21:45:36,627 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-04-02 21:45:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-02 21:45:36,627 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 4.625) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) Word has length 28 [2023-04-02 21:45:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 21:45:36,628 INFO L225 Difference]: With dead ends: 54 [2023-04-02 21:45:36,628 INFO L226 Difference]: Without dead ends: 35 [2023-04-02 21:45:36,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=159, Invalid=1247, Unknown=0, NotChecked=0, Total=1406 [2023-04-02 21:45:36,629 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-02 21:45:36,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 126 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-02 21:45:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-04-02 21:45:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2023-04-02 21:45:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 21:45:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-04-02 21:45:36,636 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2023-04-02 21:45:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 21:45:36,636 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-04-02 21:45:36,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 4.625) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2023-04-02 21:45:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-04-02 21:45:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-02 21:45:36,639 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 21:45:36,639 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2023-04-02 21:45:36,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 21:45:36,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-04-02 21:45:36,846 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 21:45:36,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 21:45:36,846 INFO L85 PathProgramCache]: Analyzing trace with hash -687705770, now seen corresponding path program 2 times [2023-04-02 21:45:36,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-02 21:45:36,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664992183] [2023-04-02 21:45:36,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 21:45:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 21:45:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 21:45:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 21:45:40,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-02 21:45:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664992183] [2023-04-02 21:45:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664992183] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 21:45:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133723147] [2023-04-02 21:45:40,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 21:45:40,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 21:45:40,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 21:45:40,808 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 21:45:40,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 21:45:41,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-02 21:45:41,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 21:45:41,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 233 conjunts are in the unsatisfiable core [2023-04-02 21:45:41,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 21:45:41,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 21:45:41,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-02 21:45:42,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2023-04-02 21:45:42,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 21:45:42,056 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 21:45:42,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 75 [2023-04-02 21:45:42,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2023-04-02 21:45:42,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:45:42,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-04-02 21:45:42,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:45:42,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-04-02 21:45:42,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:45:42,340 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-04-02 21:45:42,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-04-02 21:45:42,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 21:45:42,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 48 [2023-04-02 21:45:42,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-02 21:45:42,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-04-02 21:45:42,573 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-02 21:45:42,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 21:45:42,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-02 21:45:42,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-04-02 21:45:45,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-02 21:45:45,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-02 21:45:48,387 WARN L839 $PredicateComparison]: unable to prove that (or (exists ((dll_insert_~new_node~0.base Int)) (and (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_ArrVal_1171 Int) (v_ArrVal_1209 Int) (v_ArrVal_1174 Int) (v_ArrVal_1140 Int) (v_ArrVal_1153 Int) (v_ArrVal_1134 Int) (v_ArrVal_1136 Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1139 Int)) (let ((.cse9 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1139) 0 v_ArrVal_1140))) (.cse13 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1136) 0 v_ArrVal_1134)))) (let ((.cse12 (select (select .cse13 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|)) (.cse0 (select (select .cse9 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse14 (select .cse13 .cse0)) (.cse7 (+ .cse12 4))) (let ((.cse1 (select .cse14 .cse7)) (.cse10 (select .cse9 .cse0))) (let ((.cse3 (select .cse10 .cse7)) (.cse4 (+ 8 .cse1))) (and (not (= .cse0 0)) (not (= .cse1 0)) (= (let ((.cse2 (let ((.cse5 (let ((.cse6 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_arrayElimArr_4))) (store .cse6 .cse0 (store (select .cse6 .cse0) .cse7 v_ArrVal_1171))))) (store .cse5 dll_insert_~new_node~0.base (store (store (select .cse5 dll_insert_~new_node~0.base) 8 v_ArrVal_1174) 4 v_ArrVal_1153))))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_1209))) |c_#memory_int|) (= (let ((.cse8 (store .cse9 .cse0 (store .cse10 .cse7 dll_insert_~new_node~0.base)))) (store (store .cse8 dll_insert_~new_node~0.base (store (store (select .cse8 dll_insert_~new_node~0.base) 8 .cse0) 4 .cse3)) .cse3 (store (select (store .cse8 dll_insert_~new_node~0.base v_ArrVal_1199) .cse3) .cse4 dll_insert_~new_node~0.base))) |c_#memory_$Pointer$.base|) (= (let ((.cse11 (store .cse13 .cse0 (store .cse14 .cse7 0)))) (store (store .cse11 dll_insert_~new_node~0.base (store (store (select .cse11 dll_insert_~new_node~0.base) 8 .cse12) 4 .cse1)) .cse3 (store (select (store .cse11 dll_insert_~new_node~0.base v_ArrVal_1145) .cse3) .cse4 0))) |c_#memory_$Pointer$.offset|)))))))) (= (select v_arrayElimArr_4 0) |c_dll_insert_#in~data|))) (not (= dll_insert_~new_node~0.base 0)) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|))) (exists ((dll_insert_~new_node~0.base Int)) (and (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_ArrVal_1171 Int) (v_ArrVal_1209 Int) (v_ArrVal_1174 Int) (v_ArrVal_1140 Int) (v_ArrVal_1153 Int) (v_ArrVal_1134 Int) (v_ArrVal_1136 Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1139 Int)) (let ((.cse24 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1139) 0 v_ArrVal_1140))) (.cse28 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1136) 0 v_ArrVal_1134)))) (let ((.cse15 (select (select .cse28 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|)) (.cse21 (select (select .cse24 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse29 (select .cse28 .cse21)) (.cse22 (+ .cse15 4))) (let ((.cse27 (select .cse29 .cse22)) (.cse25 (select .cse24 .cse21))) (let ((.cse17 (select .cse25 .cse22)) (.cse18 (+ 8 .cse27))) (and (not (= .cse15 0)) (= (let ((.cse16 (let ((.cse19 (let ((.cse20 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_arrayElimArr_4))) (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 v_ArrVal_1171))))) (store .cse19 dll_insert_~new_node~0.base (store (store (select .cse19 dll_insert_~new_node~0.base) 8 v_ArrVal_1174) 4 v_ArrVal_1153))))) (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 v_ArrVal_1209))) |c_#memory_int|) (= (let ((.cse23 (store .cse24 .cse21 (store .cse25 .cse22 dll_insert_~new_node~0.base)))) (store (store .cse23 dll_insert_~new_node~0.base (store (store (select .cse23 dll_insert_~new_node~0.base) 8 .cse21) 4 .cse17)) .cse17 (store (select (store .cse23 dll_insert_~new_node~0.base v_ArrVal_1199) .cse17) .cse18 dll_insert_~new_node~0.base))) |c_#memory_$Pointer$.base|) (not (= .cse17 0)) (= (let ((.cse26 (store .cse28 .cse21 (store .cse29 .cse22 0)))) (store (store .cse26 dll_insert_~new_node~0.base (store (store (select .cse26 dll_insert_~new_node~0.base) 8 .cse15) 4 .cse27)) .cse17 (store (select (store .cse26 dll_insert_~new_node~0.base v_ArrVal_1145) .cse17) .cse18 0))) |c_#memory_$Pointer$.offset|)))))))) (= (select v_arrayElimArr_4 0) |c_dll_insert_#in~data|))) (not (= dll_insert_~new_node~0.base 0)) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|))) (exists ((dll_insert_~new_node~0.base Int)) (and (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (not (= dll_insert_~new_node~0.base 0)) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_ArrVal_1171 Int) (v_ArrVal_1209 Int) (v_ArrVal_1174 Int) (v_ArrVal_1140 Int) (v_ArrVal_1153 Int) (v_ArrVal_1134 Int) (v_ArrVal_1136 Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1139 Int)) (let ((.cse40 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1139) 0 v_ArrVal_1140))) (.cse43 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1136) 0 v_ArrVal_1134)))) (let ((.cse31 (select (select .cse43 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|)) (.cse37 (select (select .cse40 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse44 (select .cse43 .cse37)) (.cse38 (+ .cse31 4))) (let ((.cse30 (select .cse44 .cse38)) (.cse41 (select .cse40 .cse37))) (let ((.cse33 (select .cse41 .cse38)) (.cse34 (+ 8 .cse30))) (and (not (= .cse30 0)) (not (= .cse31 0)) (= (let ((.cse32 (let ((.cse35 (let ((.cse36 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_arrayElimArr_4))) (store .cse36 .cse37 (store (select .cse36 .cse37) .cse38 v_ArrVal_1171))))) (store .cse35 dll_insert_~new_node~0.base (store (store (select .cse35 dll_insert_~new_node~0.base) 8 v_ArrVal_1174) 4 v_ArrVal_1153))))) (store .cse32 .cse33 (store (select .cse32 .cse33) .cse34 v_ArrVal_1209))) |c_#memory_int|) (= (let ((.cse39 (store .cse40 .cse37 (store .cse41 .cse38 dll_insert_~new_node~0.base)))) (store (store .cse39 dll_insert_~new_node~0.base (store (store (select .cse39 dll_insert_~new_node~0.base) 8 .cse37) 4 .cse33)) .cse33 (store (select (store .cse39 dll_insert_~new_node~0.base v_ArrVal_1199) .cse33) .cse34 dll_insert_~new_node~0.base))) |c_#memory_$Pointer$.base|) (= (let ((.cse42 (store .cse43 .cse37 (store .cse44 .cse38 0)))) (store (store .cse42 dll_insert_~new_node~0.base (store (store (select .cse42 dll_insert_~new_node~0.base) 8 .cse31) 4 .cse30)) .cse33 (store (select (store .cse42 dll_insert_~new_node~0.base v_ArrVal_1145) .cse33) .cse34 0))) |c_#memory_$Pointer$.offset|)))))))) (= (select v_arrayElimArr_4 0) |c_dll_insert_#in~data|))))) (exists ((dll_insert_~new_node~0.base Int)) (and (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (not (= dll_insert_~new_node~0.base 0)) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_ArrVal_1171 Int) (v_ArrVal_1174 Int) (v_ArrVal_1140 Int) (v_ArrVal_1153 Int) (v_ArrVal_1134 Int) (v_ArrVal_1136 Int) (v_ArrVal_1139 Int)) (let ((.cse47 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1139) 0 v_ArrVal_1140))) (.cse53 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1136) 0 v_ArrVal_1134)))) (let ((.cse52 (select (select .cse53 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|)) (.cse46 (select (select .cse47 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse50 (select .cse53 .cse46)) (.cse48 (select .cse47 .cse46)) (.cse49 (+ .cse52 4))) (and (= (let ((.cse45 (store .cse47 .cse46 (store .cse48 .cse49 dll_insert_~new_node~0.base)))) (store .cse45 dll_insert_~new_node~0.base (store (store (select .cse45 dll_insert_~new_node~0.base) 8 .cse46) 4 0))) |c_#memory_$Pointer$.base|) (= (select .cse50 .cse49) 0) (not (= .cse46 0)) (= |c_#memory_$Pointer$.offset| (let ((.cse51 (store .cse53 .cse46 (store .cse50 .cse49 0)))) (store .cse51 dll_insert_~new_node~0.base (store (store (select .cse51 dll_insert_~new_node~0.base) 8 .cse52) 4 0)))) (= |c_#memory_int| (let ((.cse54 (let ((.cse55 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_arrayElimArr_4))) (store .cse55 .cse46 (store (select .cse55 .cse46) .cse49 v_ArrVal_1171))))) (store .cse54 dll_insert_~new_node~0.base (store (store (select .cse54 dll_insert_~new_node~0.base) 8 v_ArrVal_1174) 4 v_ArrVal_1153)))) (= (select .cse48 .cse49) 0)))))) (= (select v_arrayElimArr_4 0) |c_dll_insert_#in~data|))))) (exists ((dll_insert_~new_node~0.base Int)) (and (exists ((v_ArrVal_1134 Int) (v_ArrVal_1136 Int)) (= (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1136) 0 v_ArrVal_1134)) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0)) (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (exists ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (store (store (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1180) (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1163) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) v_ArrVal_1159) |c_dll_insert_#in~head.base| v_ArrVal_1165) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1140 Int) (v_ArrVal_1149 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1139 Int)) (let ((.cse56 (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1139) 0 v_ArrVal_1140))) (and (= (store (store (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1169) (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store .cse56 4 0)) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) v_ArrVal_1149) |c_dll_insert_#in~head.base| v_ArrVal_1179) |c_#memory_$Pointer$.offset|) (= (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base .cse56) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0)))) (not (= dll_insert_~new_node~0.base 0)) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (exists ((v_ArrVal_1200 (Array Int Int))) (not (= (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1200) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0))) (exists ((v_ArrVal_1192 (Array Int Int)) (v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (= (store (store (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_ArrVal_1176) (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1192) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) v_ArrVal_1175) |c_dll_insert_#in~head.base| v_ArrVal_1181) |c_#memory_int|)))) (exists ((dll_insert_~new_node~0.base Int)) (and (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_ArrVal_1171 Int) (v_ArrVal_1209 Int) (v_ArrVal_1174 Int) (v_ArrVal_1140 Int) (v_ArrVal_1153 Int) (v_ArrVal_1134 Int) (v_ArrVal_1136 Int) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1139 Int)) (let ((.cse65 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1139) 0 v_ArrVal_1140))) (.cse70 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1136) 0 v_ArrVal_1134)))) (let ((.cse68 (select (select .cse70 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|)) (.cse57 (select (select .cse65 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse71 (select .cse70 .cse57)) (.cse63 (+ .cse68 4))) (let ((.cse69 (select .cse71 .cse63)) (.cse66 (select .cse65 .cse57))) (let ((.cse59 (select .cse66 .cse63)) (.cse60 (+ 8 .cse69))) (and (not (= .cse57 0)) (= (let ((.cse58 (let ((.cse61 (let ((.cse62 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_arrayElimArr_4))) (store .cse62 .cse57 (store (select .cse62 .cse57) .cse63 v_ArrVal_1171))))) (store .cse61 dll_insert_~new_node~0.base (store (store (select .cse61 dll_insert_~new_node~0.base) 8 v_ArrVal_1174) 4 v_ArrVal_1153))))) (store .cse58 .cse59 (store (select .cse58 .cse59) .cse60 v_ArrVal_1209))) |c_#memory_int|) (= (let ((.cse64 (store .cse65 .cse57 (store .cse66 .cse63 dll_insert_~new_node~0.base)))) (store (store .cse64 dll_insert_~new_node~0.base (store (store (select .cse64 dll_insert_~new_node~0.base) 8 .cse57) 4 .cse59)) .cse59 (store (select (store .cse64 dll_insert_~new_node~0.base v_ArrVal_1199) .cse59) .cse60 dll_insert_~new_node~0.base))) |c_#memory_$Pointer$.base|) (not (= .cse59 0)) (= (let ((.cse67 (store .cse70 .cse57 (store .cse71 .cse63 0)))) (store (store .cse67 dll_insert_~new_node~0.base (store (store (select .cse67 dll_insert_~new_node~0.base) 8 .cse68) 4 .cse69)) .cse59 (store (select (store .cse67 dll_insert_~new_node~0.base v_ArrVal_1145) .cse59) .cse60 0))) |c_#memory_$Pointer$.offset|)))))))) (= (select v_arrayElimArr_4 0) |c_dll_insert_#in~data|))) (not (= dll_insert_~new_node~0.base 0)) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|))) (exists ((dll_insert_~new_node~0.base Int)) (and (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_ArrVal_1171 Int) (v_ArrVal_1174 Int) (v_ArrVal_1140 Int) (v_ArrVal_1153 Int) (v_ArrVal_1134 Int) (v_ArrVal_1136 Int) (v_ArrVal_1139 Int)) (let ((.cse74 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1139) 0 v_ArrVal_1140))) (.cse80 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1136) 0 v_ArrVal_1134)))) (let ((.cse79 (select (select .cse80 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|)) (.cse73 (select (select .cse74 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse77 (select .cse80 .cse73)) (.cse75 (select .cse74 .cse73)) (.cse76 (+ .cse79 4))) (and (= (let ((.cse72 (store .cse74 .cse73 (store .cse75 .cse76 dll_insert_~new_node~0.base)))) (store .cse72 dll_insert_~new_node~0.base (store (store (select .cse72 dll_insert_~new_node~0.base) 8 .cse73) 4 0))) |c_#memory_$Pointer$.base|) (= (select .cse77 .cse76) 0) (= |c_#memory_$Pointer$.offset| (let ((.cse78 (store .cse80 .cse73 (store .cse77 .cse76 0)))) (store .cse78 dll_insert_~new_node~0.base (store (store (select .cse78 dll_insert_~new_node~0.base) 8 .cse79) 4 0)))) (= |c_#memory_int| (let ((.cse81 (let ((.cse82 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_arrayElimArr_4))) (store .cse82 .cse73 (store (select .cse82 .cse73) .cse76 v_ArrVal_1171))))) (store .cse81 dll_insert_~new_node~0.base (store (store (select .cse81 dll_insert_~new_node~0.base) 8 v_ArrVal_1174) 4 v_ArrVal_1153)))) (= (select .cse75 .cse76) 0) (not (= .cse79 0))))))) (= (select v_arrayElimArr_4 0) |c_dll_insert_#in~data|))) (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (not (= dll_insert_~new_node~0.base 0)) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|))) (exists ((dll_insert_~new_node~0.base Int)) (and (exists ((v_ArrVal_1134 Int) (v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1136 Int)) (let ((.cse83 (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1136) 0 v_ArrVal_1134))) (and (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store .cse83 4 0)) |c_dll_insert_#in~head.base| v_ArrVal_1179)) (= (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base .cse83) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0)))) (exists ((v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1165 (Array Int Int))) (let ((.cse84 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1200))) (and (= (select (select .cse84 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0) (= |c_#memory_$Pointer$.base| (store .cse84 |c_dll_insert_#in~head.base| v_ArrVal_1165))))) (exists ((v_ArrVal_1140 Int) (v_ArrVal_1139 Int)) (= (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base) 4 0) 8 v_ArrVal_1139) 0 v_ArrVal_1140)) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0)) (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (not (= dll_insert_~new_node~0.base 0)) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (exists ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= |c_#memory_int| (store (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_ArrVal_1176) |c_dll_insert_#in~head.base| v_ArrVal_1181)))))) is different from false [2023-04-02 21:45:48,936 INFO L190 IndexEqualityManager]: detected not equals via solver