/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 IntervalDomain -i ../sv-benchmarks/c/list-simple/dll2n_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 22:53:53,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 22:53:53,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 22:53:53,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 22:53:53,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 22:53:53,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 22:53:53,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 22:53:53,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 22:53:53,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 22:53:53,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 22:53:53,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 22:53:53,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 22:53:53,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 22:53:53,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 22:53:53,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 22:53:53,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 22:53:53,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 22:53:53,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 22:53:53,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 22:53:53,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 22:53:53,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 22:53:53,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 22:53:53,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 22:53:53,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 22:53:53,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 22:53:53,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 22:53:53,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 22:53:53,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 22:53:53,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 22:53:53,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 22:53:53,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 22:53:53,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 22:53:53,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 22:53:53,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 22:53:53,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 22:53:53,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 22:53:53,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 22:53:53,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 22:53:53,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 22:53:53,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 22:53:53,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 22:53:53,437 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-03-31 22:53:53,461 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 22:53:53,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 22:53:53,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 22:53:53,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 22:53:53,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 22:53:53,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 22:53:53,462 INFO L138 SettingsManager]: * User list type=DISABLED [2023-03-31 22:53:53,462 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-03-31 22:53:53,462 INFO L138 SettingsManager]: * Explicit value domain=true [2023-03-31 22:53:53,462 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-03-31 22:53:53,463 INFO L138 SettingsManager]: * Octagon Domain=false [2023-03-31 22:53:53,463 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-03-31 22:53:53,463 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-03-31 22:53:53,463 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-03-31 22:53:53,463 INFO L138 SettingsManager]: * Interval Domain=false [2023-03-31 22:53:53,463 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-03-31 22:53:53,463 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-03-31 22:53:53,464 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-03-31 22:53:53,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 22:53:53,464 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 22:53:53,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 22:53:53,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 22:53:53,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 22:53:53,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 22:53:53,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 22:53:53,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 22:53:53,465 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 22:53:53,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 22:53:53,465 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 22:53:53,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 22:53:53,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 22:53:53,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 22:53:53,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 22:53:53,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 22:53:53,466 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-03-31 22:53:53,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 22:53:53,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 22:53:53,466 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-03-31 22:53:53,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 22:53:53,466 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 22:53:53,466 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-03-31 22:53:53,466 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 -> IntervalDomain [2023-03-31 22:53:53,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 22:53:53,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 22:53:53,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 22:53:53,669 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 22:53:53,669 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 22:53:53,670 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-03-31 22:53:54,589 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 22:53:54,799 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 22:53:54,799 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2023-03-31 22:53:54,816 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd95bccaf/7e6049992f7540728c414d024047d1ac/FLAG237c2f69e [2023-03-31 22:53:54,830 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd95bccaf/7e6049992f7540728c414d024047d1ac [2023-03-31 22:53:54,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 22:53:54,834 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 22:53:54,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 22:53:54,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 22:53:54,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 22:53:54,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 10:53:54" (1/1) ... [2023-03-31 22:53:54,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341b28b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:54, skipping insertion in model container [2023-03-31 22:53:54,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 10:53:54" (1/1) ... [2023-03-31 22:53:54,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 22:53:54,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 22:53:55,092 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-03-31 22:53:55,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 22:53:55,103 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 22:53:55,139 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-03-31 22:53:55,139 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 22:53:55,158 INFO L208 MainTranslator]: Completed translation [2023-03-31 22:53:55,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:55 WrapperNode [2023-03-31 22:53:55,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 22:53:55,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 22:53:55,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 22:53:55,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 22:53:55,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:55" (1/1) ... [2023-03-31 22:53:55,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:55" (1/1) ... [2023-03-31 22:53:55,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:55" (1/1) ... [2023-03-31 22:53:55,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:55" (1/1) ... [2023-03-31 22:53:55,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:55" (1/1) ... [2023-03-31 22:53:55,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:55" (1/1) ... [2023-03-31 22:53:55,195 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:55" (1/1) ... [2023-03-31 22:53:55,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:55" (1/1) ... [2023-03-31 22:53:55,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 22:53:55,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 22:53:55,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 22:53:55,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 22:53:55,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:55" (1/1) ... [2023-03-31 22:53:55,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 22:53:55,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:53:55,245 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-03-31 22:53:55,246 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-03-31 22:53:55,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 22:53:55,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 22:53:55,270 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 22:53:55,270 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-03-31 22:53:55,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-03-31 22:53:55,273 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-03-31 22:53:55,273 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-03-31 22:53:55,273 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2023-03-31 22:53:55,274 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2023-03-31 22:53:55,274 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert [2023-03-31 22:53:55,274 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 22:53:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 22:53:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 22:53:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-03-31 22:53:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-03-31 22:53:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 22:53:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 22:53:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-03-31 22:53:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-03-31 22:53:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-03-31 22:53:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-03-31 22:53:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-03-31 22:53:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-03-31 22:53:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-03-31 22:53:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-03-31 22:53:55,277 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-03-31 22:53:55,277 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-03-31 22:53:55,277 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-03-31 22:53:55,277 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-03-31 22:53:55,277 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-03-31 22:53:55,277 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-03-31 22:53:55,277 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-03-31 22:53:55,277 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-03-31 22:53:55,278 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-03-31 22:53:55,278 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-03-31 22:53:55,278 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-03-31 22:53:55,278 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-03-31 22:53:55,278 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-03-31 22:53:55,278 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-03-31 22:53:55,278 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-03-31 22:53:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-03-31 22:53:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-03-31 22:53:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-03-31 22:53:55,279 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-03-31 22:53:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-03-31 22:53:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-03-31 22:53:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-03-31 22:53:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-03-31 22:53:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-03-31 22:53:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-03-31 22:53:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-03-31 22:53:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-03-31 22:53:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-03-31 22:53:55,281 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-03-31 22:53:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-03-31 22:53:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-03-31 22:53:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-03-31 22:53:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-03-31 22:53:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-03-31 22:53:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-03-31 22:53:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-03-31 22:53:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-03-31 22:53:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-03-31 22:53:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-03-31 22:53:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-03-31 22:53:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-03-31 22:53:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-03-31 22:53:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-03-31 22:53:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-03-31 22:53:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-03-31 22:53:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-03-31 22:53:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-03-31 22:53:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-03-31 22:53:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-03-31 22:53:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-03-31 22:53:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-03-31 22:53:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-03-31 22:53:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-03-31 22:53:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-03-31 22:53:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-03-31 22:53:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-03-31 22:53:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-03-31 22:53:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-03-31 22:53:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-03-31 22:53:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-03-31 22:53:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-03-31 22:53:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-03-31 22:53:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-03-31 22:53:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-03-31 22:53:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-03-31 22:53:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-03-31 22:53:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-03-31 22:53:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-03-31 22:53:55,287 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-03-31 22:53:55,287 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-03-31 22:53:55,287 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-03-31 22:53:55,288 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-03-31 22:53:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-03-31 22:53:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-03-31 22:53:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 22:53:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 22:53:55,498 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 22:53:55,499 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 22:53:55,552 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-03-31 22:53:55,686 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 22:53:55,795 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 22:53:55,795 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-03-31 22:53:55,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 10:53:55 BoogieIcfgContainer [2023-03-31 22:53:55,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 22:53:55,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 22:53:55,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 22:53:55,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 22:53:55,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 10:53:54" (1/3) ... [2023-03-31 22:53:55,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22da57fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 10:53:55, skipping insertion in model container [2023-03-31 22:53:55,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:53:55" (2/3) ... [2023-03-31 22:53:55,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22da57fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 10:53:55, skipping insertion in model container [2023-03-31 22:53:55,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 10:53:55" (3/3) ... [2023-03-31 22:53:55,813 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2023-03-31 22:53:55,825 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 22:53:55,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 22:53:55,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 22:53:55,867 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;@1bfab00d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-31 22:53:55,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 22:53:55,870 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-03-31 22:53:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-03-31 22:53:55,876 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:53:55,877 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-03-31 22:53:55,877 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:53:55,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:53:55,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1354220909, now seen corresponding path program 1 times [2023-03-31 22:53:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:53:55,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665787815] [2023-03-31 22:53:55,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:53:55,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:53:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:53:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:53:56,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:53:56,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665787815] [2023-03-31 22:53:56,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665787815] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 22:53:56,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 22:53:56,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 22:53:56,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273982111] [2023-03-31 22:53:56,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 22:53:56,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 22:53:56,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:53:56,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 22:53:56,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 22:53:56,300 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-03-31 22:53:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:53:56,777 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2023-03-31 22:53:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 22:53:56,779 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-03-31 22:53:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:53:56,783 INFO L225 Difference]: With dead ends: 75 [2023-03-31 22:53:56,783 INFO L226 Difference]: Without dead ends: 31 [2023-03-31 22:53:56,787 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-03-31 22:53:56,790 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.4s IncrementalHoareTripleChecker+Time [2023-03-31 22:53:56,790 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.4s Time] [2023-03-31 22:53:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-03-31 22:53:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-03-31 22:53:56,815 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-03-31 22:53:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-03-31 22:53:56,818 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2023-03-31 22:53:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:53:56,819 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-03-31 22:53:56,819 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-03-31 22:53:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-03-31 22:53:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-03-31 22:53:56,820 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:53:56,820 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-03-31 22:53:56,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 22:53:56,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:53:56,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:53:56,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1479317610, now seen corresponding path program 1 times [2023-03-31 22:53:56,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:53:56,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266548477] [2023-03-31 22:53:56,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:53:56,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:53:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:53:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:53:57,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:53:57,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266548477] [2023-03-31 22:53:57,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266548477] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:53:57,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538595320] [2023-03-31 22:53:57,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:53:57,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:53:57,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:53:57,031 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-03-31 22:53:57,032 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-03-31 22:53:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:53:57,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjunts are in the unsatisfiable core [2023-03-31 22:53:57,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:53:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:53:57,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:53:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:53:57,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538595320] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:53:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1208312548] [2023-03-31 22:53:57,454 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-03-31 22:53:57,454 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:53:57,456 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:53:57,460 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:53:57,461 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:53:57,518 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 23 for LOIs [2023-03-31 22:53:57,866 INFO L197 IcfgInterpreter]: Interpreting procedure dll_insert with input of size 32 for LOIs [2023-03-31 22:53:57,971 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 26 for LOIs [2023-03-31 22:53:57,984 INFO L197 IcfgInterpreter]: Interpreting procedure dll_create with input of size 44 for LOIs [2023-03-31 22:53:58,124 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-03-31 22:53:58,127 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:53:58,859 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '377#(and (<= 0 |main_~#s~0.base|) (= main_~data~0 1) (= |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) (<= 0 |#StackHeapBarrier|) (= (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-03-31 22:53:58,859 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:53:58,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:53:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-03-31 22:53:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927600191] [2023-03-31 22:53:58,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:53:58,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 22:53:58,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:53:58,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 22:53:58,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2023-03-31 22:53:58,863 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 12 states, 8 states have (on average 4.375) internal successors, (35), 12 states have internal predecessors, (35), 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-03-31 22:53:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:53:59,184 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2023-03-31 22:53:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-31 22:53:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 4.375) internal successors, (35), 12 states have internal predecessors, (35), 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 27 [2023-03-31 22:53:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:53:59,194 INFO L225 Difference]: With dead ends: 52 [2023-03-31 22:53:59,194 INFO L226 Difference]: Without dead ends: 34 [2023-03-31 22:53:59,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2023-03-31 22:53:59,195 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-03-31 22:53:59,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-03-31 22:53:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-03-31 22:53:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-03-31 22:53:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-03-31 22:53:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-03-31 22:53:59,199 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 27 [2023-03-31 22:53:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:53:59,199 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-03-31 22:53:59,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 4.375) internal successors, (35), 12 states have internal predecessors, (35), 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-03-31 22:53:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-03-31 22:53:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-03-31 22:53:59,200 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:53:59,200 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] [2023-03-31 22:53:59,209 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-03-31 22:53:59,406 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-03-31 22:53:59,407 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:53:59,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:53:59,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2138101555, now seen corresponding path program 2 times [2023-03-31 22:53:59,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:53:59,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930182286] [2023-03-31 22:53:59,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:53:59,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:53:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:53:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-03-31 22:53:59,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:53:59,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930182286] [2023-03-31 22:53:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930182286] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 22:53:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 22:53:59,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 22:53:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177956045] [2023-03-31 22:53:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 22:53:59,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 22:53:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:53:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 22:53:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 22:53:59,752 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-03-31 22:54:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:54:00,117 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-03-31 22:54:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 22:54:00,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2023-03-31 22:54:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:54:00,118 INFO L225 Difference]: With dead ends: 40 [2023-03-31 22:54:00,118 INFO L226 Difference]: Without dead ends: 33 [2023-03-31 22:54:00,118 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-03-31 22:54:00,119 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-03-31 22:54:00,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-03-31 22:54:00,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-03-31 22:54:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-03-31 22:54:00,122 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-03-31 22:54:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-03-31 22:54:00,123 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 30 [2023-03-31 22:54:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:54:00,123 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-03-31 22:54:00,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-03-31 22:54:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-03-31 22:54:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-03-31 22:54:00,123 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:54:00,123 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-03-31 22:54:00,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-31 22:54:00,124 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:54:00,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:54:00,124 INFO L85 PathProgramCache]: Analyzing trace with hash -687705770, now seen corresponding path program 1 times [2023-03-31 22:54:00,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:54:00,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927337947] [2023-03-31 22:54:00,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:54:00,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:54:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:54:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:54:04,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:54:04,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927337947] [2023-03-31 22:54:04,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927337947] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:54:04,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188015884] [2023-03-31 22:54:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:54:04,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:54:04,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:54:04,824 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-03-31 22:54:04,827 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-03-31 22:54:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:54:05,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 202 conjunts are in the unsatisfiable core [2023-03-31 22:54:05,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:54:06,018 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-03-31 22:54:06,063 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-03-31 22:54:06,239 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-03-31 22:54:06,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:54:06,247 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-03-31 22:54:06,253 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-03-31 22:54:06,265 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 22:54:06,265 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 68 treesize of output 61 [2023-03-31 22:54:06,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:54:06,282 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-03-31 22:54:06,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:54:06,455 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-03-31 22:54:06,456 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 3 case distinctions, treesize of input 32 treesize of output 38 [2023-03-31 22:54:06,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:54:06,625 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 100 treesize of output 43 [2023-03-31 22:54:06,631 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-03-31 22:54:06,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:54:06,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-03-31 22:54:10,099 WARN L839 $PredicateComparison]: unable to prove that (or (exists ((dll_insert_~new_node~0.base Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1032 (Array Int Int)) (v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1072 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1060 (Array Int Int))) (and (exists ((v_ArrVal_1061 (Array Int Int))) (not (= (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1061) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0))) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store v_ArrVal_1014 4 0)) (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1036) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) v_ArrVal_1056) |c_dll_insert_#in~head.base| v_ArrVal_1031)) (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (= (store (store (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store v_ArrVal_1011 4 0)) (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1071) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) v_ArrVal_1027) |c_dll_insert_#in~head.base| v_ArrVal_1032) |c_#memory_$Pointer$.offset|) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1011) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1014) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|)) (= (store (store (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_ArrVal_1060) (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1033) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) v_ArrVal_1044) |c_dll_insert_#in~head.base| v_ArrVal_1072) |c_#memory_int|))) (exists ((dll_insert_~new_node~0.base Int)) (and (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (exists ((v_ArrVal_1014 (Array Int Int))) (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1014))) (let ((.cse2 (select (select .cse3 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (and (exists ((v_ArrVal_1063 Int) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1065 (Array Int Int))) (let ((.cse9 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1011))) (let ((.cse7 (select (select .cse9 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse4 (select .cse3 .cse2)) (.cse5 (+ .cse7 4))) (let ((.cse0 (select .cse4 .cse5))) (and (not (= .cse0 0)) (= |c_#memory_$Pointer$.base| (store (let ((.cse1 (store .cse3 .cse2 (store .cse4 .cse5 dll_insert_~new_node~0.base)))) (store .cse1 dll_insert_~new_node~0.base (store (store (select .cse1 dll_insert_~new_node~0.base) 8 .cse2) 4 .cse0))) .cse0 v_ArrVal_1065)) (= |c_#memory_$Pointer$.offset| (store (let ((.cse8 (select .cse9 .cse2))) (let ((.cse6 (store .cse9 .cse2 (store .cse8 .cse5 0)))) (store .cse6 dll_insert_~new_node~0.base (store (store (select .cse6 dll_insert_~new_node~0.base) 8 .cse7) 4 (select .cse8 .cse5))))) .cse0 v_ArrVal_1058)) (= |c_#memory_int| (store (store (let ((.cse10 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_ArrVal_1015))) (store .cse10 .cse2 (store (select .cse10 .cse2) .cse5 v_ArrVal_1063))) dll_insert_~new_node~0.base v_ArrVal_1029) .cse0 v_ArrVal_1022)))))))) (not (= 0 .cse2)))))))) (exists ((dll_insert_~new_node~0.base Int)) (and (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (exists ((v_ArrVal_1011 (Array Int Int))) (let ((.cse20 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1011))) (let ((.cse11 (select (select .cse20 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (and (not (= .cse11 0)) (exists ((v_ArrVal_1063 Int) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1065 (Array Int Int))) (let ((.cse15 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1014))) (let ((.cse14 (select (select .cse15 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse16 (select .cse15 .cse14)) (.cse17 (+ .cse11 4))) (let ((.cse12 (select .cse16 .cse17))) (and (not (= .cse12 0)) (= |c_#memory_$Pointer$.base| (store (let ((.cse13 (store .cse15 .cse14 (store .cse16 .cse17 dll_insert_~new_node~0.base)))) (store .cse13 dll_insert_~new_node~0.base (store (store (select .cse13 dll_insert_~new_node~0.base) 8 .cse14) 4 .cse12))) .cse12 v_ArrVal_1065)) (= |c_#memory_$Pointer$.offset| (store (let ((.cse19 (select .cse20 .cse14))) (let ((.cse18 (store .cse20 .cse14 (store .cse19 .cse17 0)))) (store .cse18 dll_insert_~new_node~0.base (store (store (select .cse18 dll_insert_~new_node~0.base) 8 .cse11) 4 (select .cse19 .cse17))))) .cse12 v_ArrVal_1058)) (= |c_#memory_int| (store (store (let ((.cse21 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_ArrVal_1015))) (store .cse21 .cse14 (store (select .cse21 .cse14) .cse17 v_ArrVal_1063))) dll_insert_~new_node~0.base v_ArrVal_1029) .cse12 v_ArrVal_1022)))))))))))))) (exists ((dll_insert_~new_node~0.base Int)) (and (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (exists ((v_ArrVal_1063 Int) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (let ((.cse24 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1014)) (.cse31 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1011))) (let ((.cse30 (select (select .cse31 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|)) (.cse23 (select (select .cse24 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse25 (select .cse24 .cse23)) (.cse27 (select .cse31 .cse23)) (.cse26 (+ .cse30 4))) (and (= (let ((.cse22 (store .cse24 .cse23 (store .cse25 .cse26 dll_insert_~new_node~0.base)))) (store .cse22 dll_insert_~new_node~0.base (store (store (select .cse22 dll_insert_~new_node~0.base) 8 .cse23) 4 0))) |c_#memory_$Pointer$.base|) (= (select .cse27 .cse26) 0) (= (select .cse25 .cse26) 0) (= (store (let ((.cse28 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_ArrVal_1015))) (store .cse28 .cse23 (store (select .cse28 .cse23) .cse26 v_ArrVal_1063))) dll_insert_~new_node~0.base v_ArrVal_1029) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (let ((.cse29 (store .cse31 .cse23 (store .cse27 .cse26 0)))) (store .cse29 dll_insert_~new_node~0.base (store (store (select .cse29 dll_insert_~new_node~0.base) 8 .cse30) 4 0)))) (not (= 0 .cse23))))))))) (exists ((dll_insert_~new_node~0.base Int)) (and (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (exists ((v_ArrVal_1063 Int) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (let ((.cse35 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1014)) (.cse41 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1011))) (let ((.cse32 (select (select .cse41 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|)) (.cse34 (select (select .cse35 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse36 (select .cse35 .cse34)) (.cse38 (select .cse41 .cse34)) (.cse37 (+ .cse32 4))) (and (not (= .cse32 0)) (= (let ((.cse33 (store .cse35 .cse34 (store .cse36 .cse37 dll_insert_~new_node~0.base)))) (store .cse33 dll_insert_~new_node~0.base (store (store (select .cse33 dll_insert_~new_node~0.base) 8 .cse34) 4 0))) |c_#memory_$Pointer$.base|) (= (select .cse38 .cse37) 0) (= (select .cse36 .cse37) 0) (= (store (let ((.cse39 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_ArrVal_1015))) (store .cse39 .cse34 (store (select .cse39 .cse34) .cse37 v_ArrVal_1063))) dll_insert_~new_node~0.base v_ArrVal_1029) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (let ((.cse40 (store .cse41 .cse34 (store .cse38 .cse37 0)))) (store .cse40 dll_insert_~new_node~0.base (store (store (select .cse40 dll_insert_~new_node~0.base) 8 .cse32) 4 0))))))))))) (exists ((dll_insert_~new_node~0.base Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1032 (Array Int Int)) (v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1072 (Array Int Int)) (v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1060 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base (store v_ArrVal_1014 4 0)) (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1036) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) v_ArrVal_1056) |c_dll_insert_#in~head.base| v_ArrVal_1031)) (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (= (store (store (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base (store v_ArrVal_1011 4 0)) (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1071) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) v_ArrVal_1027) |c_dll_insert_#in~head.base| v_ArrVal_1032) |c_#memory_$Pointer$.offset|) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1011) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0) (exists ((v_ArrVal_1030 (Array Int Int))) (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1030) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0))) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1014) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|)) (= (store (store (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_ArrVal_1060) (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1033) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) v_ArrVal_1044) |c_dll_insert_#in~head.base| v_ArrVal_1072) |c_#memory_int|))) (exists ((dll_insert_~new_node~0.base Int)) (and (exists ((v_ArrVal_1032 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse42 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1030))) (and (= (select (select .cse42 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0) (= |c_#memory_$Pointer$.offset| (store .cse42 |c_dll_insert_#in~head.base| v_ArrVal_1032))))) (= (select |c_old(#valid)| dll_insert_~new_node~0.base) 0) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (exists ((v_ArrVal_1011 (Array Int Int))) (= (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1011) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0)) (exists ((v_ArrVal_1014 (Array Int Int))) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1014) |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (exists ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1072 (Array Int Int))) (= |c_#memory_int| (store (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_ArrVal_1060) |c_dll_insert_#in~head.base| v_ArrVal_1072))) (exists ((v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (let ((.cse43 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1061))) (and (= |c_#memory_$Pointer$.base| (store .cse43 |c_dll_insert_#in~head.base| v_ArrVal_1031)) (= (select (select .cse43 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|) 0)))))) (exists ((dll_insert_~new_node~0.base Int)) (and (exists ((v_ArrVal_1014 (Array Int Int))) (let ((.cse47 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1014))) (let ((.cse45 (select (select .cse47 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (and (exists ((v_ArrVal_1063 Int) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1065 (Array Int Int))) (let ((.cse53 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1011))) (let ((.cse52 (select (select .cse53 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse48 (select .cse47 .cse45)) (.cse54 (select .cse53 .cse45)) (.cse49 (+ .cse52 4))) (let ((.cse50 (select .cse54 .cse49)) (.cse46 (select .cse48 .cse49))) (and (= |c_#memory_$Pointer$.base| (store (let ((.cse44 (store .cse47 .cse45 (store .cse48 .cse49 dll_insert_~new_node~0.base)))) (store .cse44 dll_insert_~new_node~0.base (store (store (select .cse44 dll_insert_~new_node~0.base) 8 .cse45) 4 .cse46))) .cse46 v_ArrVal_1065)) (not (= .cse50 0)) (= |c_#memory_$Pointer$.offset| (store (let ((.cse51 (store .cse53 .cse45 (store .cse54 .cse49 0)))) (store .cse51 dll_insert_~new_node~0.base (store (store (select .cse51 dll_insert_~new_node~0.base) 8 .cse52) 4 .cse50))) .cse46 v_ArrVal_1058)) (= |c_#memory_int| (store (store (let ((.cse55 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_ArrVal_1015))) (store .cse55 .cse45 (store (select .cse55 .cse45) .cse49 v_ArrVal_1063))) dll_insert_~new_node~0.base v_ArrVal_1029) .cse46 v_ArrVal_1022)))))))) (not (= 0 .cse45)))))) (= (select |c_old(#valid)| 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) (< dll_insert_~new_node~0.base |c_#StackHeapBarrier|) (exists ((v_ArrVal_1011 (Array Int Int))) (let ((.cse65 (store |c_old(#memory_$Pointer$.offset)| dll_insert_~new_node~0.base v_ArrVal_1011))) (let ((.cse56 (select (select .cse65 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (and (not (= .cse56 0)) (exists ((v_ArrVal_1063 Int) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1022 (Array Int Int)) (v_ArrVal_1065 (Array Int Int))) (let ((.cse60 (store |c_old(#memory_$Pointer$.base)| dll_insert_~new_node~0.base v_ArrVal_1014))) (let ((.cse58 (select (select .cse60 |c_dll_insert_#in~head.base|) |c_dll_insert_#in~head.offset|))) (let ((.cse61 (select .cse60 .cse58)) (.cse66 (select .cse65 .cse58)) (.cse62 (+ .cse56 4))) (let ((.cse63 (select .cse66 .cse62)) (.cse59 (select .cse61 .cse62))) (and (= |c_#memory_$Pointer$.base| (store (let ((.cse57 (store .cse60 .cse58 (store .cse61 .cse62 dll_insert_~new_node~0.base)))) (store .cse57 dll_insert_~new_node~0.base (store (store (select .cse57 dll_insert_~new_node~0.base) 8 .cse58) 4 .cse59))) .cse59 v_ArrVal_1065)) (not (= .cse63 0)) (= |c_#memory_$Pointer$.offset| (store (let ((.cse64 (store .cse65 .cse58 (store .cse66 .cse62 0)))) (store .cse64 dll_insert_~new_node~0.base (store (store (select .cse64 dll_insert_~new_node~0.base) 8 .cse56) 4 .cse63))) .cse59 v_ArrVal_1058)) (= |c_#memory_int| (store (store (let ((.cse67 (store |c_old(#memory_int)| dll_insert_~new_node~0.base v_ArrVal_1015))) (store .cse67 .cse58 (store (select .cse67 .cse58) .cse62 v_ArrVal_1063))) dll_insert_~new_node~0.base v_ArrVal_1029) .cse59 v_ArrVal_1022))))))))))))))) is different from false