/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_prepend_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:16:23,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:16:23,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:16:23,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:16:23,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:16:23,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:16:23,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:16:23,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:16:23,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:16:23,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:16:23,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:16:23,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:16:23,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:16:23,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:16:23,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:16:23,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:16:23,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:16:23,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:16:23,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:16:23,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:16:23,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:16:23,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:16:23,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:16:23,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:16:23,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:16:23,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:16:23,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:16:23,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:16:23,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:16:23,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:16:23,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:16:23,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:16:23,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:16:23,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:16:23,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:16:23,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:16:23,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:16:23,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:16:23,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:16:23,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:16:23,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:16:23,347 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:16:23,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:16:23,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:16:23,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:16:23,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:16:23,363 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:16:23,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:16:23,363 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:16:23,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:16:23,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:16:23,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:16:23,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:16:23,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:16:23,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:16:23,365 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:16:23,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:16:23,365 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:16:23,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:16:23,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:16:23,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:16:23,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:16:23,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:16:23,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:16:23,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:16:23,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:16:23,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:16:23,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:16:23,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:16:23,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:16:23,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:16:23,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:16:23,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:16:23,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:16:23,653 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:16:23,654 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:16:23,655 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_prepend_unequal.i [2019-11-06 21:16:23,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013cd545c/b84ec3a8f12e4266ae51af6be5dda7e6/FLAGa4e9020d5 [2019-11-06 21:16:24,257 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:16:24,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_prepend_unequal.i [2019-11-06 21:16:24,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013cd545c/b84ec3a8f12e4266ae51af6be5dda7e6/FLAGa4e9020d5 [2019-11-06 21:16:24,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013cd545c/b84ec3a8f12e4266ae51af6be5dda7e6 [2019-11-06 21:16:24,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:16:24,585 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:16:24,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:16:24,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:16:24,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:16:24,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:24" (1/1) ... [2019-11-06 21:16:24,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e866cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:24, skipping insertion in model container [2019-11-06 21:16:24,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:24" (1/1) ... [2019-11-06 21:16:24,605 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:16:24,662 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:16:25,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:16:25,101 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:16:25,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:16:25,217 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:16:25,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:25 WrapperNode [2019-11-06 21:16:25,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:16:25,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:16:25,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:16:25,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:16:25,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:25" (1/1) ... [2019-11-06 21:16:25,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:25" (1/1) ... [2019-11-06 21:16:25,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:25" (1/1) ... [2019-11-06 21:16:25,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:25" (1/1) ... [2019-11-06 21:16:25,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:25" (1/1) ... [2019-11-06 21:16:25,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:25" (1/1) ... [2019-11-06 21:16:25,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:25" (1/1) ... [2019-11-06 21:16:25,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:16:25,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:16:25,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:16:25,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:16:25,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:16:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:16:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:16:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 21:16:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 21:16:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-06 21:16:25,359 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-06 21:16:25,360 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-06 21:16:25,360 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-11-06 21:16:25,360 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_prepend [2019-11-06 21:16:25,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:16:25,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:16:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 21:16:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 21:16:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 21:16:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 21:16:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 21:16:25,361 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 21:16:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 21:16:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 21:16:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 21:16:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 21:16:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 21:16:25,362 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 21:16:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 21:16:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 21:16:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 21:16:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 21:16:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 21:16:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 21:16:25,364 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 21:16:25,364 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 21:16:25,364 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 21:16:25,364 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 21:16:25,364 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 21:16:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 21:16:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 21:16:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 21:16:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 21:16:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 21:16:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 21:16:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 21:16:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 21:16:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 21:16:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 21:16:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 21:16:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 21:16:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 21:16:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 21:16:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 21:16:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 21:16:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 21:16:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 21:16:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 21:16:25,367 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 21:16:25,368 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 21:16:25,368 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 21:16:25,368 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 21:16:25,368 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 21:16:25,368 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 21:16:25,368 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 21:16:25,368 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 21:16:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 21:16:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 21:16:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 21:16:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 21:16:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 21:16:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 21:16:25,369 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 21:16:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 21:16:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 21:16:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 21:16:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 21:16:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 21:16:25,370 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 21:16:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 21:16:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 21:16:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 21:16:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 21:16:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 21:16:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 21:16:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 21:16:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 21:16:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 21:16:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 21:16:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 21:16:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 21:16:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 21:16:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 21:16:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 21:16:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 21:16:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 21:16:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 21:16:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 21:16:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 21:16:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 21:16:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 21:16:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 21:16:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 21:16:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 21:16:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 21:16:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 21:16:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 21:16:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 21:16:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 21:16:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 21:16:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 21:16:25,375 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 21:16:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 21:16:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 21:16:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 21:16:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 21:16:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 21:16:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 21:16:25,376 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 21:16:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 21:16:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 21:16:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-06 21:16:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-06 21:16:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 21:16:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:16:25,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:16:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-06 21:16:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-11-06 21:16:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:16:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:16:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_prepend [2019-11-06 21:16:25,378 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:16:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 21:16:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-06 21:16:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:16:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:16:25,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:16:25,839 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-06 21:16:26,021 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:16:26,022 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 21:16:26,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:26 BoogieIcfgContainer [2019-11-06 21:16:26,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:16:26,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:16:26,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:16:26,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:16:26,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:16:24" (1/3) ... [2019-11-06 21:16:26,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c736679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:26, skipping insertion in model container [2019-11-06 21:16:26,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:25" (2/3) ... [2019-11-06 21:16:26,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c736679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:26, skipping insertion in model container [2019-11-06 21:16:26,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:26" (3/3) ... [2019-11-06 21:16:26,043 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2019-11-06 21:16:26,055 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:16:26,067 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:16:26,080 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:16:26,114 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:16:26,114 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:16:26,114 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:16:26,114 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:16:26,115 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:16:26,115 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:16:26,115 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:16:26,115 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:16:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2019-11-06 21:16:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:16:26,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:26,150 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:26,155 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:26,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:26,163 INFO L82 PathProgramCache]: Analyzing trace with hash 619880496, now seen corresponding path program 1 times [2019-11-06 21:16:26,173 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:26,173 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051751299] [2019-11-06 21:16:26,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 21:16:26,617 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051751299] [2019-11-06 21:16:26,618 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:16:26,618 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:16:26,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898654174] [2019-11-06 21:16:26,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:16:26,625 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:16:26,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:16:26,643 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2019-11-06 21:16:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:26,971 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2019-11-06 21:16:26,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:16:26,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-06 21:16:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:26,983 INFO L225 Difference]: With dead ends: 99 [2019-11-06 21:16:26,983 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 21:16:26,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:16:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 21:16:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-06 21:16:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-06 21:16:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2019-11-06 21:16:27,044 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2019-11-06 21:16:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:27,046 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-11-06 21:16:27,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:16:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2019-11-06 21:16:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:16:27,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:27,050 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:27,051 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:27,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:27,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1639628125, now seen corresponding path program 1 times [2019-11-06 21:16:27,052 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:27,052 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924595773] [2019-11-06 21:16:27,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 21:16:27,370 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924595773] [2019-11-06 21:16:27,371 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:16:27,371 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:16:27,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762542201] [2019-11-06 21:16:27,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:16:27,374 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:27,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:16:27,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:16:27,374 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 7 states. [2019-11-06 21:16:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:27,735 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2019-11-06 21:16:27,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:16:27,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-06 21:16:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:27,737 INFO L225 Difference]: With dead ends: 70 [2019-11-06 21:16:27,737 INFO L226 Difference]: Without dead ends: 45 [2019-11-06 21:16:27,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:16:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-06 21:16:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2019-11-06 21:16:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 21:16:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-06 21:16:27,758 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 35 [2019-11-06 21:16:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:27,760 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-06 21:16:27,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:16:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-06 21:16:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 21:16:27,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:27,765 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-11-06 21:16:27,765 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:27,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:27,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1024501097, now seen corresponding path program 1 times [2019-11-06 21:16:27,766 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:27,766 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186389095] [2019-11-06 21:16:27,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 21:16:28,430 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186389095] [2019-11-06 21:16:28,431 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566124392] [2019-11-06 21:16:28,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:28,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-06 21:16:28,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:28,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 8 treesize of output 4 [2019-11-06 21:16:28,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:28,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:28,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:28,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-06 21:16:30,593 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-06 21:16:32,448 WARN L191 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-06 21:16:32,473 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:32,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:32,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:32,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-11-06 21:16:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:16:36,732 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:16:36,733 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 28 [2019-11-06 21:16:36,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287434150] [2019-11-06 21:16:36,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-06 21:16:36,734 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:36,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-06 21:16:36,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=677, Unknown=2, NotChecked=0, Total=756 [2019-11-06 21:16:36,735 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 28 states. [2019-11-06 21:16:38,962 WARN L191 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-06 21:16:43,696 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-06 21:16:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:44,595 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-11-06 21:16:44,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 21:16:44,601 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-06 21:16:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:44,603 INFO L225 Difference]: With dead ends: 77 [2019-11-06 21:16:44,603 INFO L226 Difference]: Without dead ends: 45 [2019-11-06 21:16:44,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=133, Invalid=1197, Unknown=2, NotChecked=0, Total=1332 [2019-11-06 21:16:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-06 21:16:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-11-06 21:16:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 21:16:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-11-06 21:16:44,620 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 45 [2019-11-06 21:16:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:44,621 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-11-06 21:16:44,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-06 21:16:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-11-06 21:16:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 21:16:44,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:44,624 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-11-06 21:16:44,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:44,830 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1081759399, now seen corresponding path program 1 times [2019-11-06 21:16:44,831 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:44,832 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647811582] [2019-11-06 21:16:44,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,939 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-11-06 21:16:46,380 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-11-06 21:16:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 21:16:46,799 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647811582] [2019-11-06 21:16:46,799 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176037693] [2019-11-06 21:16:46,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:46,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 128 conjunts are in the unsatisfiable core [2019-11-06 21:16:46,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:46,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing 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 [2019-11-06 21:16:46,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:46,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:46,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:46,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:16:47,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing 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 [2019-11-06 21:16:47,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:47,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-11-06 21:16:47,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:47,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-06 21:16:47,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,369 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-11-06 21:16:47,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-06 21:16:47,581 INFO L341 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2019-11-06 21:16:47,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 29 treesize of output 17 [2019-11-06 21:16:47,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:47,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:47,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-11-06 21:16:47,913 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:47,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-06 21:16:47,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:47,933 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_1|], 4=[|v_#memory_$Pointer$.base_BEFORE_CALL_5|]} [2019-11-06 21:16:47,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 3 [2019-11-06 21:16:47,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:47,984 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:47,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2019-11-06 21:16:47,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:47,988 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:48,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:48,001 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:81, output treesize:10 [2019-11-06 21:16:48,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-06 21:16:48,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:48,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:48,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:48,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:77 [2019-11-06 21:16:48,592 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_50|, |v_#memory_int_48|, |v_#memory_int_49|, |v_#memory_int_46|, |v_#memory_int_47|], 18=[|v_#memory_$Pointer$.offset_44|], 32=[|v_#memory_$Pointer$.base_46|]} [2019-11-06 21:16:48,772 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 21:16:48,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-11-06 21:16:48,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 21:16:49,813 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 112 [2019-11-06 21:16:49,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:49,842 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:50,761 WARN L191 SmtUtils]: Spent 918.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-06 21:16:50,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:50,786 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:51,583 WARN L191 SmtUtils]: Spent 796.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-11-06 21:16:51,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:52,029 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-11-06 21:16:52,029 INFO L341 Elim1Store]: treesize reduction 242, result has 34.2 percent of original size [2019-11-06 21:16:52,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 137 [2019-11-06 21:16:52,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:52,031 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:52,947 WARN L191 SmtUtils]: Spent 915.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-11-06 21:16:52,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:53,133 INFO L341 Elim1Store]: treesize reduction 32, result has 66.7 percent of original size [2019-11-06 21:16:53,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 192 [2019-11-06 21:16:53,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:53,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:53,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:53,137 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:54,922 WARN L191 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2019-11-06 21:16:54,922 INFO L567 ElimStorePlain]: treesize reduction 164, result has 85.1 percent of original size [2019-11-06 21:16:54,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:54,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:54,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:54,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:54,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:54,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:54,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:54,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:54,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:54,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:54,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:54,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:54,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:54,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:54,951 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:56,178 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 106 [2019-11-06 21:16:56,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:56,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:56,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:56,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:56,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:56,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:56,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:56,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:56,231 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:57,237 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 103 [2019-11-06 21:16:57,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:57,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:57,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:57,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:57,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:57,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:57,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:57,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:57,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:57,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:57,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 21:16:57,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:57,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:57,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:57,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:57,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:57,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:57,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 7 dim-2 vars, End of recursive call: 67 dim-0 vars, and 16 xjuncts. [2019-11-06 21:16:57,301 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:933, output treesize:41400 [2019-11-06 21:16:57,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:16:57,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,371 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse159 (= |c_dll_circular_prepend_#in~head.offset| 8)) (.cse160 (<= (+ |c_#StackHeapBarrier| 1) |c_dll_circular_prepend_#in~head.base|)) (.cse161 (= (select |c_old(#valid)| |c_dll_circular_prepend_#in~head.base|) 0))) (or (exists ((v_prenex_18 Int) (v_prenex_17 Int) (dll_circular_prepend_~last~1.offset Int) (v_prenex_19 Int)) (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| v_prenex_19 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_19) 0 0) 4 0) 8 v_prenex_17)))) (let ((.cse12 (store |c_old(#memory_$Pointer$.offset)| v_prenex_19 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_19) 0 0) 4 0) 8 v_prenex_18))) (.cse7 (select .cse6 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse0 (select .cse7 |c_dll_circular_prepend_#in~head.offset|)) (.cse13 (select .cse12 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse2 (select (select .cse6 .cse0) (+ (select .cse13 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse0 v_prenex_19) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_19) (= (select |c_old(#valid)| v_prenex_19) 0) (= (let ((.cse1 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store .cse6 |c_dll_circular_prepend_#in~head.base| (store .cse7 |c_dll_circular_prepend_#in~head.offset| v_prenex_19)))) (store .cse5 v_prenex_19 (store (select .cse5 v_prenex_19) 0 .cse0))))) (store .cse4 .cse0 (store (select .cse4 .cse0) 8 v_prenex_19))))) (store .cse3 .cse2 (store (select .cse3 .cse2) dll_circular_prepend_~last~1.offset v_prenex_19))))) (store .cse1 v_prenex_19 (store (select .cse1 v_prenex_19) 4 .cse2))) |c_#memory_$Pointer$.base|) (= (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (store .cse12 |c_dll_circular_prepend_#in~head.base| (store .cse13 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse11 v_prenex_19 (store (select .cse11 v_prenex_19) 0 4))))) (store .cse10 .cse0 (store (select .cse10 .cse0) 8 0))))) (store .cse9 .cse2 (store (select .cse9 .cse2) dll_circular_prepend_~last~1.offset 0))))) (store .cse8 v_prenex_19 (store (select .cse8 v_prenex_19) 4 dll_circular_prepend_~last~1.offset))) |c_#memory_$Pointer$.offset|))))))) (exists ((v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse26 (store |c_old(#memory_$Pointer$.base)| v_prenex_30 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_30) 0 0) 4 0) 8 v_prenex_31)))) (let ((.cse20 (store |c_old(#memory_$Pointer$.offset)| v_prenex_30 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_30) 0 0) 4 0) 8 v_prenex_32))) (.cse27 (select .cse26 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse14 (select .cse27 |c_dll_circular_prepend_#in~head.offset|)) (.cse21 (select .cse20 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse15 (select (select .cse26 .cse14) (+ (select .cse21 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse14 v_prenex_30) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_30) (= .cse14 .cse15) (= |c_#memory_$Pointer$.offset| (let ((.cse16 (let ((.cse17 (let ((.cse18 (let ((.cse19 (store .cse20 |c_dll_circular_prepend_#in~head.base| (store .cse21 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse19 v_prenex_30 (store (select .cse19 v_prenex_30) 0 4))))) (store .cse18 .cse14 (store (select .cse18 .cse14) 8 0))))) (store .cse17 .cse15 (store (select .cse17 .cse15) 8 0))))) (store .cse16 v_prenex_30 (store (select .cse16 v_prenex_30) 4 8)))) (= |c_#memory_$Pointer$.base| (let ((.cse22 (let ((.cse23 (let ((.cse24 (let ((.cse25 (store .cse26 |c_dll_circular_prepend_#in~head.base| (store .cse27 |c_dll_circular_prepend_#in~head.offset| v_prenex_30)))) (store .cse25 v_prenex_30 (store (select .cse25 v_prenex_30) 0 .cse14))))) (store .cse24 .cse14 (store (select .cse24 .cse14) 8 v_prenex_30))))) (store .cse23 .cse15 (store (select .cse23 .cse15) 8 v_prenex_30))))) (store .cse22 v_prenex_30 (store (select .cse22 v_prenex_30) 4 .cse15)))) (= (select |c_old(#valid)| v_prenex_30) 0))))))) (exists ((v_prenex_59 Int) (v_prenex_56 Int) (v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse34 (store |c_old(#memory_$Pointer$.base)| v_prenex_56 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_56) 0 0) 4 0) 8 v_prenex_57)))) (let ((.cse40 (store |c_old(#memory_$Pointer$.offset)| v_prenex_56 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_56) 0 0) 4 0) 8 v_prenex_58))) (.cse35 (select .cse34 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse28 (select .cse35 |c_dll_circular_prepend_#in~head.offset|)) (.cse41 (select .cse40 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse30 (select (select .cse34 .cse28) (+ (select .cse41 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (<= (+ |c_#StackHeapBarrier| 1) v_prenex_56) (= (select |c_old(#valid)| v_prenex_56) 0) (= (select (select |c_#memory_int| v_prenex_56) 8) |c_dll_circular_prepend_#in~data|) (= .cse28 v_prenex_56) (= |c_#memory_$Pointer$.base| (let ((.cse29 (let ((.cse31 (let ((.cse32 (let ((.cse33 (store .cse34 |c_dll_circular_prepend_#in~head.base| (store .cse35 |c_dll_circular_prepend_#in~head.offset| v_prenex_56)))) (store .cse33 v_prenex_56 (store (select .cse33 v_prenex_56) 0 .cse28))))) (store .cse32 .cse28 (store (select .cse32 .cse28) 0 v_prenex_56))))) (store .cse31 .cse30 (store (select .cse31 .cse30) v_prenex_59 v_prenex_56))))) (store .cse29 v_prenex_56 (store (select .cse29 v_prenex_56) 4 .cse30)))) (= (let ((.cse36 (let ((.cse37 (let ((.cse38 (let ((.cse39 (store .cse40 |c_dll_circular_prepend_#in~head.base| (store .cse41 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse39 v_prenex_56 (store (select .cse39 v_prenex_56) 0 (- 4)))))) (store .cse38 .cse28 (store (select .cse38 .cse28) 0 0))))) (store .cse37 .cse30 (store (select .cse37 .cse30) v_prenex_59 0))))) (store .cse36 v_prenex_56 (store (select .cse36 v_prenex_56) 4 v_prenex_59))) |c_#memory_$Pointer$.offset|))))))) (exists ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (dll_circular_prepend_~new_head~1.base Int)) (let ((.cse48 (store |c_old(#memory_$Pointer$.base)| dll_circular_prepend_~new_head~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_circular_prepend_~new_head~1.base) 0 0) 4 0) 8 v_DerPreprocessor_5)))) (let ((.cse54 (store |c_old(#memory_$Pointer$.offset)| dll_circular_prepend_~new_head~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_circular_prepend_~new_head~1.base) 0 0) 4 0) 8 v_DerPreprocessor_4))) (.cse49 (select .cse48 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse42 (select .cse49 |c_dll_circular_prepend_#in~head.offset|)) (.cse55 (select .cse54 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse43 (select (select .cse48 .cse42) (+ (select .cse55 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (select (select |c_#memory_int| dll_circular_prepend_~new_head~1.base) 8) |c_dll_circular_prepend_#in~data|) (<= (+ |c_#StackHeapBarrier| 1) dll_circular_prepend_~new_head~1.base) (= .cse42 .cse43) (= .cse43 dll_circular_prepend_~new_head~1.base) (= (select |c_old(#valid)| dll_circular_prepend_~new_head~1.base) 0) (= (let ((.cse44 (let ((.cse45 (let ((.cse46 (let ((.cse47 (store .cse48 |c_dll_circular_prepend_#in~head.base| (store .cse49 |c_dll_circular_prepend_#in~head.offset| dll_circular_prepend_~new_head~1.base)))) (store .cse47 dll_circular_prepend_~new_head~1.base (store (select .cse47 dll_circular_prepend_~new_head~1.base) 0 .cse42))))) (store .cse46 .cse42 (store (select .cse46 .cse42) 0 dll_circular_prepend_~new_head~1.base))))) (store .cse45 .cse43 (store (select .cse45 .cse43) 0 dll_circular_prepend_~new_head~1.base))))) (store .cse44 dll_circular_prepend_~new_head~1.base (store (select .cse44 dll_circular_prepend_~new_head~1.base) 4 .cse43))) |c_#memory_$Pointer$.base|) (= (let ((.cse50 (let ((.cse51 (let ((.cse52 (let ((.cse53 (store .cse54 |c_dll_circular_prepend_#in~head.base| (store .cse55 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse53 dll_circular_prepend_~new_head~1.base (store (select .cse53 dll_circular_prepend_~new_head~1.base) 0 (- 4)))))) (store .cse52 .cse42 (store (select .cse52 .cse42) 0 0))))) (store .cse51 .cse43 (store (select .cse51 .cse43) 0 0))))) (store .cse50 dll_circular_prepend_~new_head~1.base (store (select .cse50 dll_circular_prepend_~new_head~1.base) 4 0))) |c_#memory_$Pointer$.offset|))))))) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_24 Int) (dll_circular_prepend_~old_head~0.offset Int)) (let ((.cse63 (store |c_old(#memory_$Pointer$.base)| v_prenex_23 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_23) 0 0) 4 0) 8 v_prenex_24)))) (let ((.cse69 (store |c_old(#memory_$Pointer$.offset)| v_prenex_23 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_23) 0 0) 4 0) 8 v_prenex_25))) (.cse64 (select .cse63 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse61 (select .cse64 |c_dll_circular_prepend_#in~head.offset|)) (.cse70 (select .cse69 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse57 (select (select .cse63 .cse61) (+ (select .cse70 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse59 (+ dll_circular_prepend_~old_head~0.offset 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse56 (let ((.cse58 (let ((.cse60 (let ((.cse62 (store .cse63 |c_dll_circular_prepend_#in~head.base| (store .cse64 |c_dll_circular_prepend_#in~head.offset| v_prenex_23)))) (store .cse62 v_prenex_23 (store (select .cse62 v_prenex_23) 0 .cse61))))) (store .cse60 .cse61 (store (select .cse60 .cse61) .cse59 v_prenex_23))))) (store .cse58 .cse57 (store (select .cse58 .cse57) .cse59 v_prenex_23))))) (store .cse56 v_prenex_23 (store (select .cse56 v_prenex_23) 4 .cse57)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_23) (= .cse61 .cse57) (= (let ((.cse65 (let ((.cse66 (let ((.cse67 (let ((.cse68 (store .cse69 |c_dll_circular_prepend_#in~head.base| (store .cse70 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse68 v_prenex_23 (store (select .cse68 v_prenex_23) 0 dll_circular_prepend_~old_head~0.offset))))) (store .cse67 .cse61 (store (select .cse67 .cse61) .cse59 0))))) (store .cse66 .cse57 (store (select .cse66 .cse57) .cse59 0))))) (store .cse65 v_prenex_23 (store (select .cse65 v_prenex_23) 4 .cse59))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| v_prenex_23) 0) (= (select (select |c_#memory_int| v_prenex_23) 8) |c_dll_circular_prepend_#in~data|))))))) (exists ((v_prenex_48 Int) (v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (let ((.cse78 (store |c_old(#memory_$Pointer$.base)| v_prenex_45 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_45) 0 0) 4 0) 8 v_prenex_46)))) (let ((.cse84 (store |c_old(#memory_$Pointer$.offset)| v_prenex_45 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_45) 0 0) 4 0) 8 v_prenex_47))) (.cse79 (select .cse78 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse75 (select .cse79 |c_dll_circular_prepend_#in~head.offset|)) (.cse85 (select .cse84 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse72 (select (select .cse78 .cse75) (+ (select .cse85 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse76 (+ v_prenex_44 4))) (and (= (select (select |c_#memory_int| v_prenex_45) 8) |c_dll_circular_prepend_#in~data|) (= |c_#memory_$Pointer$.base| (let ((.cse71 (let ((.cse73 (let ((.cse74 (let ((.cse77 (store .cse78 |c_dll_circular_prepend_#in~head.base| (store .cse79 |c_dll_circular_prepend_#in~head.offset| v_prenex_45)))) (store .cse77 v_prenex_45 (store (select .cse77 v_prenex_45) 0 .cse75))))) (store .cse74 .cse75 (store (select .cse74 .cse75) .cse76 v_prenex_45))))) (store .cse73 .cse72 (store (select .cse73 .cse72) v_prenex_48 v_prenex_45))))) (store .cse71 v_prenex_45 (store (select .cse71 v_prenex_45) 4 .cse72)))) (= (select |c_old(#valid)| v_prenex_45) 0) (= (let ((.cse80 (let ((.cse81 (let ((.cse82 (let ((.cse83 (store .cse84 |c_dll_circular_prepend_#in~head.base| (store .cse85 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse83 v_prenex_45 (store (select .cse83 v_prenex_45) 0 v_prenex_44))))) (store .cse82 .cse75 (store (select .cse82 .cse75) .cse76 0))))) (store .cse81 .cse72 (store (select .cse81 .cse72) v_prenex_48 0))))) (store .cse80 v_prenex_45 (store (select .cse80 v_prenex_45) 4 v_prenex_48))) |c_#memory_$Pointer$.offset|) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_45))))))) (exists ((v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse98 (store |c_old(#memory_$Pointer$.base)| v_prenex_60 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_60) 0 0) 4 0) 8 v_prenex_61)))) (let ((.cse92 (store |c_old(#memory_$Pointer$.offset)| v_prenex_60 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_60) 0 0) 4 0) 8 v_prenex_62))) (.cse99 (select .cse98 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse86 (select .cse99 |c_dll_circular_prepend_#in~head.offset|)) (.cse93 (select .cse92 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse89 (select (select .cse98 .cse86) (+ (select .cse93 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse86 v_prenex_60) (= (let ((.cse87 (let ((.cse88 (let ((.cse90 (let ((.cse91 (store .cse92 |c_dll_circular_prepend_#in~head.base| (store .cse93 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse91 v_prenex_60 (store (select .cse91 v_prenex_60) 0 (- 4)))))) (store .cse90 .cse86 (store (select .cse90 .cse86) 0 0))))) (store .cse88 .cse89 (store (select .cse88 .cse89) 8 0))))) (store .cse87 v_prenex_60 (store (select .cse87 v_prenex_60) 4 8))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse94 (let ((.cse95 (let ((.cse96 (let ((.cse97 (store .cse98 |c_dll_circular_prepend_#in~head.base| (store .cse99 |c_dll_circular_prepend_#in~head.offset| v_prenex_60)))) (store .cse97 v_prenex_60 (store (select .cse97 v_prenex_60) 0 .cse86))))) (store .cse96 .cse86 (store (select .cse96 .cse86) 0 v_prenex_60))))) (store .cse95 .cse89 (store (select .cse95 .cse89) 8 v_prenex_60))))) (store .cse94 v_prenex_60 (store (select .cse94 v_prenex_60) 4 .cse89)))) (= (select |c_old(#valid)| v_prenex_60) 0) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_60) (= .cse89 v_prenex_60))))))) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int)) (let ((.cse106 (store |c_old(#memory_$Pointer$.base)| v_prenex_16 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_16) 0 0) 4 0) 8 v_prenex_14)))) (let ((.cse112 (store |c_old(#memory_$Pointer$.offset)| v_prenex_16 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_16) 0 0) 4 0) 8 v_prenex_15))) (.cse107 (select .cse106 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse101 (select .cse107 |c_dll_circular_prepend_#in~head.offset|)) (.cse113 (select .cse112 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse100 (select (select .cse106 .cse101) (+ (select .cse113 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse100 v_prenex_16) (= (select |c_old(#valid)| v_prenex_16) 0) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_16) (= .cse101 v_prenex_16) (= |c_#memory_$Pointer$.base| (let ((.cse102 (let ((.cse103 (let ((.cse104 (let ((.cse105 (store .cse106 |c_dll_circular_prepend_#in~head.base| (store .cse107 |c_dll_circular_prepend_#in~head.offset| v_prenex_16)))) (store .cse105 v_prenex_16 (store (select .cse105 v_prenex_16) 0 .cse101))))) (store .cse104 .cse101 (store (select .cse104 .cse101) 8 v_prenex_16))))) (store .cse103 .cse100 (store (select .cse103 .cse100) 0 v_prenex_16))))) (store .cse102 v_prenex_16 (store (select .cse102 v_prenex_16) 4 .cse100)))) (= (let ((.cse108 (let ((.cse109 (let ((.cse110 (let ((.cse111 (store .cse112 |c_dll_circular_prepend_#in~head.base| (store .cse113 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse111 v_prenex_16 (store (select .cse111 v_prenex_16) 0 4))))) (store .cse110 .cse101 (store (select .cse110 .cse101) 8 0))))) (store .cse109 .cse100 (store (select .cse109 .cse100) 0 0))))) (store .cse108 v_prenex_16 (store (select .cse108 v_prenex_16) 4 0))) |c_#memory_$Pointer$.offset|))))))) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse120 (store |c_old(#memory_$Pointer$.base)| v_prenex_13 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_13) 0 0) 4 0) 8 v_prenex_11)))) (let ((.cse126 (store |c_old(#memory_$Pointer$.offset)| v_prenex_13 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_13) 0 0) 4 0) 8 v_prenex_12))) (.cse121 (select .cse120 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse118 (select .cse121 |c_dll_circular_prepend_#in~head.offset|)) (.cse127 (select .cse126 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse115 (select (select .cse120 .cse118) (+ (select .cse127 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (select |c_old(#valid)| v_prenex_13) 0) (= |c_#memory_$Pointer$.base| (let ((.cse114 (let ((.cse116 (let ((.cse117 (let ((.cse119 (store .cse120 |c_dll_circular_prepend_#in~head.base| (store .cse121 |c_dll_circular_prepend_#in~head.offset| v_prenex_13)))) (store .cse119 v_prenex_13 (store (select .cse119 v_prenex_13) 0 .cse118))))) (store .cse117 .cse118 (store (select .cse117 .cse118) 0 v_prenex_13))))) (store .cse116 .cse115 (store (select .cse116 .cse115) 0 v_prenex_13))))) (store .cse114 v_prenex_13 (store (select .cse114 v_prenex_13) 4 .cse115)))) (= .cse118 v_prenex_13) (= (select (select |c_#memory_int| v_prenex_13) 8) |c_dll_circular_prepend_#in~data|) (= |c_#memory_$Pointer$.offset| (let ((.cse122 (let ((.cse123 (let ((.cse124 (let ((.cse125 (store .cse126 |c_dll_circular_prepend_#in~head.base| (store .cse127 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse125 v_prenex_13 (store (select .cse125 v_prenex_13) 0 (- 4)))))) (store .cse124 .cse118 (store (select .cse124 .cse118) 0 0))))) (store .cse123 .cse115 (store (select .cse123 .cse115) 0 0))))) (store .cse122 v_prenex_13 (store (select .cse122 v_prenex_13) 4 0)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_13) (= .cse118 .cse115))))))) (and (or (exists ((v_prenex_4 Int) (v_prenex_33 Int) (v_prenex_3 Int)) (let ((.cse138 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_3))) (let ((.cse133 (select .cse138 |c_dll_circular_prepend_#in~head.offset|)) (.cse134 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_4))) (let ((.cse131 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse138) .cse133) (+ (select .cse134 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse129 (+ v_prenex_33 4))) (and (= |c_#memory_$Pointer$.offset| (let ((.cse128 (let ((.cse130 (let ((.cse132 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse134 |c_dll_circular_prepend_#in~head.offset| 0) 0 v_prenex_33)))) (store .cse132 .cse133 (store (select .cse132 .cse133) .cse129 0))))) (store .cse130 .cse131 (store (select .cse130 .cse131) .cse129 0))))) (store .cse128 |c_dll_circular_prepend_#in~head.base| (store (select .cse128 |c_dll_circular_prepend_#in~head.base|) 4 .cse129)))) (= .cse131 .cse133) (= |c_#memory_$Pointer$.base| (let ((.cse135 (let ((.cse136 (let ((.cse137 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse138 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse133)))) (store .cse137 .cse133 (store (select .cse137 .cse133) .cse129 |c_dll_circular_prepend_#in~head.base|))))) (store .cse136 .cse131 (store (select .cse136 .cse131) .cse129 |c_dll_circular_prepend_#in~head.base|))))) (store .cse135 |c_dll_circular_prepend_#in~head.base| (store (select .cse135 |c_dll_circular_prepend_#in~head.base|) 4 .cse131))))))))) (exists ((v_prenex_34 Int) (v_prenex_35 Int)) (let ((.cse148 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_34))) (let ((.cse140 (select .cse148 |c_dll_circular_prepend_#in~head.offset|)) (.cse144 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_35))) (let ((.cse139 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse148) .cse140) (+ (select .cse144 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse139 .cse140) (= (let ((.cse141 (let ((.cse142 (let ((.cse143 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse144 |c_dll_circular_prepend_#in~head.offset| 0) 0 (- 4))))) (store .cse143 .cse140 (store (select .cse143 .cse140) 0 0))))) (store .cse142 .cse139 (store (select .cse142 .cse139) 0 0))))) (store .cse141 |c_dll_circular_prepend_#in~head.base| (store (select .cse141 |c_dll_circular_prepend_#in~head.base|) 4 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse145 (let ((.cse146 (let ((.cse147 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse148 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse140)))) (store .cse147 .cse140 (store (select .cse147 .cse140) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse146 .cse139 (store (select .cse146 .cse139) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse145 |c_dll_circular_prepend_#in~head.base| (store (select .cse145 |c_dll_circular_prepend_#in~head.base|) 4 .cse139)))) (= |c_dll_circular_prepend_#in~head.base| .cse139)))))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse158 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_1))) (let ((.cse149 (select .cse158 |c_dll_circular_prepend_#in~head.offset|)) (.cse154 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_2))) (let ((.cse152 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse158) .cse149) (+ (select .cse154 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_dll_circular_prepend_#in~head.base| .cse149) (= (let ((.cse150 (let ((.cse151 (let ((.cse153 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse154 |c_dll_circular_prepend_#in~head.offset| 0) 0 (- 4))))) (store .cse153 .cse149 (store (select .cse153 .cse149) 0 0))))) (store .cse151 .cse152 (store (select .cse151 .cse152) 0 0))))) (store .cse150 |c_dll_circular_prepend_#in~head.base| (store (select .cse150 |c_dll_circular_prepend_#in~head.base|) 4 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse155 (let ((.cse156 (let ((.cse157 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse158 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse149)))) (store .cse157 .cse149 (store (select .cse157 .cse149) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse156 .cse152 (store (select .cse156 .cse152) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse155 |c_dll_circular_prepend_#in~head.base| (store (select .cse155 |c_dll_circular_prepend_#in~head.base|) 4 .cse152)))) (= .cse152 .cse149))))))) .cse159 .cse160 .cse161) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_36 Int)) (let ((.cse169 (store |c_old(#memory_$Pointer$.base)| v_prenex_37 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_37) 0 0) 4 0) 8 v_prenex_38)))) (let ((.cse175 (store |c_old(#memory_$Pointer$.offset)| v_prenex_37 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_37) 0 0) 4 0) 8 v_prenex_39))) (.cse170 (select .cse169 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse166 (select .cse170 |c_dll_circular_prepend_#in~head.offset|)) (.cse176 (select .cse175 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse167 (+ v_prenex_36 4)) (.cse163 (select (select .cse169 .cse166) (+ (select .cse176 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse162 (let ((.cse164 (let ((.cse165 (let ((.cse168 (store .cse169 |c_dll_circular_prepend_#in~head.base| (store .cse170 |c_dll_circular_prepend_#in~head.offset| v_prenex_37)))) (store .cse168 v_prenex_37 (store (select .cse168 v_prenex_37) 0 .cse166))))) (store .cse165 .cse166 (store (select .cse165 .cse166) .cse167 v_prenex_37))))) (store .cse164 .cse163 (store (select .cse164 .cse163) 8 v_prenex_37))))) (store .cse162 v_prenex_37 (store (select .cse162 v_prenex_37) 4 .cse163)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_37) (= (let ((.cse171 (let ((.cse172 (let ((.cse173 (let ((.cse174 (store .cse175 |c_dll_circular_prepend_#in~head.base| (store .cse176 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse174 v_prenex_37 (store (select .cse174 v_prenex_37) 0 v_prenex_36))))) (store .cse173 .cse166 (store (select .cse173 .cse166) .cse167 0))))) (store .cse172 .cse163 (store (select .cse172 .cse163) 8 0))))) (store .cse171 v_prenex_37 (store (select .cse171 v_prenex_37) 4 8))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| v_prenex_37) 0) (= .cse163 v_prenex_37))))))) (exists ((v_prenex_55 Int) (v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse183 (store |c_old(#memory_$Pointer$.base)| v_prenex_53 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_53) 0 0) 4 0) 8 v_prenex_54)))) (let ((.cse189 (store |c_old(#memory_$Pointer$.offset)| v_prenex_53 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_53) 0 0) 4 0) 8 v_prenex_55))) (.cse184 (select .cse183 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse181 (select .cse184 |c_dll_circular_prepend_#in~head.offset|)) (.cse190 (select .cse189 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse178 (select (select .cse183 .cse181) (+ (select .cse190 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (or (= (select (select |c_#memory_int| v_prenex_53) 8) |c_dll_circular_prepend_#in~data|) (and (= |c_dll_circular_prepend_#in~head.offset| 8) (= v_prenex_53 |c_dll_circular_prepend_#in~head.base|))) (= |c_#memory_$Pointer$.base| (let ((.cse177 (let ((.cse179 (let ((.cse180 (let ((.cse182 (store .cse183 |c_dll_circular_prepend_#in~head.base| (store .cse184 |c_dll_circular_prepend_#in~head.offset| v_prenex_53)))) (store .cse182 v_prenex_53 (store (select .cse182 v_prenex_53) 0 .cse181))))) (store .cse180 .cse181 (store (select .cse180 .cse181) 4 v_prenex_53))))) (store .cse179 .cse178 (store (select .cse179 .cse178) 0 v_prenex_53))))) (store .cse177 v_prenex_53 (store (select .cse177 v_prenex_53) 4 .cse178)))) (= .cse178 v_prenex_53) (= (let ((.cse185 (let ((.cse186 (let ((.cse187 (let ((.cse188 (store .cse189 |c_dll_circular_prepend_#in~head.base| (store .cse190 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse188 v_prenex_53 (store (select .cse188 v_prenex_53) 0 0))))) (store .cse187 .cse181 (store (select .cse187 .cse181) 4 0))))) (store .cse186 .cse178 (store (select .cse186 .cse178) 0 0))))) (store .cse185 v_prenex_53 (store (select .cse185 v_prenex_53) 4 0))) |c_#memory_$Pointer$.offset|) (= .cse181 v_prenex_53) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_53) (= (select |c_old(#valid)| v_prenex_53) 0))))))) (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse197 (store |c_old(#memory_$Pointer$.base)| v_prenex_22 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_22) 0 0) 4 0) 8 v_prenex_20)))) (let ((.cse203 (store |c_old(#memory_$Pointer$.offset)| v_prenex_22 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_22) 0 0) 4 0) 8 v_prenex_21))) (.cse198 (select .cse197 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse195 (select .cse198 |c_dll_circular_prepend_#in~head.offset|)) (.cse204 (select .cse203 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse192 (select (select .cse197 .cse195) (+ (select .cse204 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse191 (let ((.cse193 (let ((.cse194 (let ((.cse196 (store .cse197 |c_dll_circular_prepend_#in~head.base| (store .cse198 |c_dll_circular_prepend_#in~head.offset| v_prenex_22)))) (store .cse196 v_prenex_22 (store (select .cse196 v_prenex_22) 0 .cse195))))) (store .cse194 .cse195 (store (select .cse194 .cse195) 8 v_prenex_22))))) (store .cse193 .cse192 (store (select .cse193 .cse192) 8 v_prenex_22))))) (store .cse191 v_prenex_22 (store (select .cse191 v_prenex_22) 4 .cse192)))) (= .cse192 v_prenex_22) (= (select |c_old(#valid)| v_prenex_22) 0) (= (let ((.cse199 (let ((.cse200 (let ((.cse201 (let ((.cse202 (store .cse203 |c_dll_circular_prepend_#in~head.base| (store .cse204 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse202 v_prenex_22 (store (select .cse202 v_prenex_22) 0 4))))) (store .cse201 .cse195 (store (select .cse201 .cse195) 8 0))))) (store .cse200 .cse192 (store (select .cse200 .cse192) 8 0))))) (store .cse199 v_prenex_22 (store (select .cse199 v_prenex_22) 4 8))) |c_#memory_$Pointer$.offset|) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_22) (= .cse195 .cse192))))))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int)) (let ((.cse218 (store |c_old(#memory_$Pointer$.base)| v_prenex_27 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_27) 0 0) 4 0) 8 v_prenex_28)))) (let ((.cse212 (store |c_old(#memory_$Pointer$.offset)| v_prenex_27 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_27) 0 0) 4 0) 8 v_prenex_29))) (.cse219 (select .cse218 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse209 (select .cse219 |c_dll_circular_prepend_#in~head.offset|)) (.cse213 (select .cse212 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse205 (select (select .cse218 .cse209) (+ (select .cse213 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse210 (+ v_prenex_26 4))) (and (= (select (select |c_#memory_int| v_prenex_27) 8) |c_dll_circular_prepend_#in~data|) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_27) (= .cse205 v_prenex_27) (= (select |c_old(#valid)| v_prenex_27) 0) (= (let ((.cse206 (let ((.cse207 (let ((.cse208 (let ((.cse211 (store .cse212 |c_dll_circular_prepend_#in~head.base| (store .cse213 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse211 v_prenex_27 (store (select .cse211 v_prenex_27) 0 v_prenex_26))))) (store .cse208 .cse209 (store (select .cse208 .cse209) .cse210 0))))) (store .cse207 .cse205 (store (select .cse207 .cse205) 0 0))))) (store .cse206 v_prenex_27 (store (select .cse206 v_prenex_27) 4 0))) |c_#memory_$Pointer$.offset|) (= (let ((.cse214 (let ((.cse215 (let ((.cse216 (let ((.cse217 (store .cse218 |c_dll_circular_prepend_#in~head.base| (store .cse219 |c_dll_circular_prepend_#in~head.offset| v_prenex_27)))) (store .cse217 v_prenex_27 (store (select .cse217 v_prenex_27) 0 .cse209))))) (store .cse216 .cse209 (store (select .cse216 .cse209) .cse210 v_prenex_27))))) (store .cse215 .cse205 (store (select .cse215 .cse205) 0 v_prenex_27))))) (store .cse214 v_prenex_27 (store (select .cse214 v_prenex_27) 4 .cse205))) |c_#memory_$Pointer$.base|))))))) (and (or (exists ((v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse225 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_9))) (let ((.cse224 (select .cse225 |c_dll_circular_prepend_#in~head.offset|)) (.cse229 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_10))) (let ((.cse221 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse225) .cse224) (+ (select .cse229 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse220 (let ((.cse222 (let ((.cse223 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse225 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse224)))) (store .cse223 .cse224 (store (select .cse223 .cse224) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse222 .cse221 (store (select .cse222 .cse221) v_prenex_8 |c_dll_circular_prepend_#in~head.base|))))) (store .cse220 |c_dll_circular_prepend_#in~head.base| (store (select .cse220 |c_dll_circular_prepend_#in~head.base|) 4 .cse221)))) (= |c_#memory_$Pointer$.offset| (let ((.cse226 (let ((.cse227 (let ((.cse228 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse229 |c_dll_circular_prepend_#in~head.offset| 0) 0 (- 4))))) (store .cse228 .cse224 (store (select .cse228 .cse224) 0 0))))) (store .cse227 .cse221 (store (select .cse227 .cse221) v_prenex_8 0))))) (store .cse226 |c_dll_circular_prepend_#in~head.base| (store (select .cse226 |c_dll_circular_prepend_#in~head.base|) 4 v_prenex_8)))) (= |c_dll_circular_prepend_#in~head.base| .cse224)))))) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (let ((.cse236 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_5))) (let ((.cse234 (select .cse236 |c_dll_circular_prepend_#in~head.offset|)) (.cse240 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_6))) (let ((.cse231 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse236) .cse234) (+ (select .cse240 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse235 (+ v_prenex_7 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse230 (let ((.cse232 (let ((.cse233 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse236 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse234)))) (store .cse233 .cse234 (store (select .cse233 .cse234) .cse235 |c_dll_circular_prepend_#in~head.base|))))) (store .cse232 .cse231 (store (select .cse232 .cse231) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse230 |c_dll_circular_prepend_#in~head.base| (store (select .cse230 |c_dll_circular_prepend_#in~head.base|) 4 .cse231)))) (= |c_dll_circular_prepend_#in~head.base| .cse231) (= |c_#memory_$Pointer$.offset| (let ((.cse237 (let ((.cse238 (let ((.cse239 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse240 |c_dll_circular_prepend_#in~head.offset| 0) 0 v_prenex_7)))) (store .cse239 .cse234 (store (select .cse239 .cse234) .cse235 0))))) (store .cse238 .cse231 (store (select .cse238 .cse231) 0 0))))) (store .cse237 |c_dll_circular_prepend_#in~head.base| (store (select .cse237 |c_dll_circular_prepend_#in~head.base|) 4 0))))))))) (exists ((v_prenex_41 Int) (v_prenex_40 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (let ((.cse247 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_42))) (let ((.cse245 (select .cse247 |c_dll_circular_prepend_#in~head.offset|)) (.cse251 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_43))) (let ((.cse242 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse247) .cse245) (+ (select .cse251 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse246 (+ v_prenex_41 4))) (and (= (let ((.cse241 (let ((.cse243 (let ((.cse244 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse247 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse245)))) (store .cse244 .cse245 (store (select .cse244 .cse245) .cse246 |c_dll_circular_prepend_#in~head.base|))))) (store .cse243 .cse242 (store (select .cse243 .cse242) v_prenex_40 |c_dll_circular_prepend_#in~head.base|))))) (store .cse241 |c_dll_circular_prepend_#in~head.base| (store (select .cse241 |c_dll_circular_prepend_#in~head.base|) 4 .cse242))) |c_#memory_$Pointer$.base|) (= (let ((.cse248 (let ((.cse249 (let ((.cse250 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse251 |c_dll_circular_prepend_#in~head.offset| 0) 0 v_prenex_41)))) (store .cse250 .cse245 (store (select .cse250 .cse245) .cse246 0))))) (store .cse249 .cse242 (store (select .cse249 .cse242) v_prenex_40 0))))) (store .cse248 |c_dll_circular_prepend_#in~head.base| (store (select .cse248 |c_dll_circular_prepend_#in~head.base|) 4 v_prenex_40))) |c_#memory_$Pointer$.offset|))))))) .cse159 .cse160 .cse161) (exists ((v_prenex_49 Int) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (let ((.cse258 (store |c_old(#memory_$Pointer$.base)| v_prenex_49 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_49) 0 0) 4 0) 8 v_prenex_50)))) (let ((.cse264 (store |c_old(#memory_$Pointer$.offset)| v_prenex_49 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_49) 0 0) 4 0) 8 v_prenex_51))) (.cse259 (select .cse258 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse256 (select .cse259 |c_dll_circular_prepend_#in~head.offset|)) (.cse265 (select .cse264 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse253 (select (select .cse258 .cse256) (+ (select .cse265 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse252 (let ((.cse254 (let ((.cse255 (let ((.cse257 (store .cse258 |c_dll_circular_prepend_#in~head.base| (store .cse259 |c_dll_circular_prepend_#in~head.offset| v_prenex_49)))) (store .cse257 v_prenex_49 (store (select .cse257 v_prenex_49) 0 .cse256))))) (store .cse255 .cse256 (store (select .cse255 .cse256) 4 v_prenex_49))))) (store .cse254 .cse253 (store (select .cse254 .cse253) v_prenex_52 v_prenex_49))))) (store .cse252 v_prenex_49 (store (select .cse252 v_prenex_49) 4 .cse253)))) (or (and (= .cse253 v_prenex_49) (= 8 v_prenex_52)) (and (= |c_dll_circular_prepend_#in~head.offset| 8) (= v_prenex_49 |c_dll_circular_prepend_#in~head.base|)) (= (select (select |c_#memory_int| v_prenex_49) 8) |c_dll_circular_prepend_#in~data|)) (= |c_#memory_$Pointer$.offset| (let ((.cse260 (let ((.cse261 (let ((.cse262 (let ((.cse263 (store .cse264 |c_dll_circular_prepend_#in~head.base| (store .cse265 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse263 v_prenex_49 (store (select .cse263 v_prenex_49) 0 0))))) (store .cse262 .cse256 (store (select .cse262 .cse256) 4 0))))) (store .cse261 .cse253 (store (select .cse261 .cse253) v_prenex_52 0))))) (store .cse260 v_prenex_49 (store (select .cse260 v_prenex_49) 4 v_prenex_52)))) (= (select |c_old(#valid)| v_prenex_49) 0) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_49) (= .cse256 v_prenex_49))))))))) is different from false [2019-11-06 21:16:59,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:59,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:17:01,510 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (= |c_dll_circular_prepend_#in~head.offset| 8)) (.cse15 (<= (+ |c_#StackHeapBarrier| 1) |c_dll_circular_prepend_#in~head.base|)) (.cse16 (= (select |c_old(#valid)| |c_dll_circular_prepend_#in~head.base|) 0))) (or (exists ((v_prenex_18 Int) (v_prenex_17 Int) (dll_circular_prepend_~last~1.offset Int) (v_prenex_19 Int)) (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| v_prenex_19 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_19) 0 0) 4 0) 8 v_prenex_17)))) (let ((.cse12 (store |c_old(#memory_$Pointer$.offset)| v_prenex_19 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_19) 0 0) 4 0) 8 v_prenex_18))) (.cse7 (select .cse6 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse0 (select .cse7 |c_dll_circular_prepend_#in~head.offset|)) (.cse13 (select .cse12 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse2 (select (select .cse6 .cse0) (+ (select .cse13 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse0 v_prenex_19) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_19) (= (select |c_old(#valid)| v_prenex_19) 0) (= (let ((.cse1 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store .cse6 |c_dll_circular_prepend_#in~head.base| (store .cse7 |c_dll_circular_prepend_#in~head.offset| v_prenex_19)))) (store .cse5 v_prenex_19 (store (select .cse5 v_prenex_19) 0 .cse0))))) (store .cse4 .cse0 (store (select .cse4 .cse0) 8 v_prenex_19))))) (store .cse3 .cse2 (store (select .cse3 .cse2) dll_circular_prepend_~last~1.offset v_prenex_19))))) (store .cse1 v_prenex_19 (store (select .cse1 v_prenex_19) 4 .cse2))) |c_#memory_$Pointer$.base|) (= (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (store .cse12 |c_dll_circular_prepend_#in~head.base| (store .cse13 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse11 v_prenex_19 (store (select .cse11 v_prenex_19) 0 4))))) (store .cse10 .cse0 (store (select .cse10 .cse0) 8 0))))) (store .cse9 .cse2 (store (select .cse9 .cse2) dll_circular_prepend_~last~1.offset 0))))) (store .cse8 v_prenex_19 (store (select .cse8 v_prenex_19) 4 dll_circular_prepend_~last~1.offset))) |c_#memory_$Pointer$.offset|))))))) (and .cse14 .cse15 .cse16 (exists ((v_prenex_41 Int) (v_prenex_40 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (let ((.cse23 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_42))) (let ((.cse21 (select .cse23 |c_dll_circular_prepend_#in~head.offset|)) (.cse27 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_43))) (let ((.cse18 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse23) .cse21) (+ (select .cse27 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse22 (+ v_prenex_41 4))) (and (= (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse23 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse21)))) (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |c_dll_circular_prepend_#in~head.base|))))) (store .cse19 .cse18 (store (select .cse19 .cse18) v_prenex_40 |c_dll_circular_prepend_#in~head.base|))))) (store .cse17 |c_dll_circular_prepend_#in~head.base| (store (select .cse17 |c_dll_circular_prepend_#in~head.base|) 4 .cse18))) |c_#memory_$Pointer$.base|) (= (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse27 |c_dll_circular_prepend_#in~head.offset| 0) 0 v_prenex_41)))) (store .cse26 .cse21 (store (select .cse26 .cse21) .cse22 0))))) (store .cse25 .cse18 (store (select .cse25 .cse18) v_prenex_40 0))))) (store .cse24 |c_dll_circular_prepend_#in~head.base| (store (select .cse24 |c_dll_circular_prepend_#in~head.base|) 4 v_prenex_40))) |c_#memory_$Pointer$.offset|))))))) (exists ((v_prenex_30 Int) (v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse40 (store |c_old(#memory_$Pointer$.base)| v_prenex_30 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_30) 0 0) 4 0) 8 v_prenex_31)))) (let ((.cse34 (store |c_old(#memory_$Pointer$.offset)| v_prenex_30 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_30) 0 0) 4 0) 8 v_prenex_32))) (.cse41 (select .cse40 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse28 (select .cse41 |c_dll_circular_prepend_#in~head.offset|)) (.cse35 (select .cse34 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse29 (select (select .cse40 .cse28) (+ (select .cse35 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse28 v_prenex_30) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_30) (= .cse28 .cse29) (= |c_#memory_$Pointer$.offset| (let ((.cse30 (let ((.cse31 (let ((.cse32 (let ((.cse33 (store .cse34 |c_dll_circular_prepend_#in~head.base| (store .cse35 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse33 v_prenex_30 (store (select .cse33 v_prenex_30) 0 4))))) (store .cse32 .cse28 (store (select .cse32 .cse28) 8 0))))) (store .cse31 .cse29 (store (select .cse31 .cse29) 8 0))))) (store .cse30 v_prenex_30 (store (select .cse30 v_prenex_30) 4 8)))) (= |c_#memory_$Pointer$.base| (let ((.cse36 (let ((.cse37 (let ((.cse38 (let ((.cse39 (store .cse40 |c_dll_circular_prepend_#in~head.base| (store .cse41 |c_dll_circular_prepend_#in~head.offset| v_prenex_30)))) (store .cse39 v_prenex_30 (store (select .cse39 v_prenex_30) 0 .cse28))))) (store .cse38 .cse28 (store (select .cse38 .cse28) 8 v_prenex_30))))) (store .cse37 .cse29 (store (select .cse37 .cse29) 8 v_prenex_30))))) (store .cse36 v_prenex_30 (store (select .cse36 v_prenex_30) 4 .cse29)))) (= (select |c_old(#valid)| v_prenex_30) 0))))))) (exists ((v_prenex_59 Int) (v_prenex_56 Int) (v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse48 (store |c_old(#memory_$Pointer$.base)| v_prenex_56 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_56) 0 0) 4 0) 8 v_prenex_57)))) (let ((.cse54 (store |c_old(#memory_$Pointer$.offset)| v_prenex_56 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_56) 0 0) 4 0) 8 v_prenex_58))) (.cse49 (select .cse48 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse42 (select .cse49 |c_dll_circular_prepend_#in~head.offset|)) (.cse55 (select .cse54 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse44 (select (select .cse48 .cse42) (+ (select .cse55 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (<= (+ |c_#StackHeapBarrier| 1) v_prenex_56) (= (select |c_old(#valid)| v_prenex_56) 0) (= (select (select |c_#memory_int| v_prenex_56) 8) |c_dll_circular_prepend_#in~data|) (= .cse42 v_prenex_56) (= |c_#memory_$Pointer$.base| (let ((.cse43 (let ((.cse45 (let ((.cse46 (let ((.cse47 (store .cse48 |c_dll_circular_prepend_#in~head.base| (store .cse49 |c_dll_circular_prepend_#in~head.offset| v_prenex_56)))) (store .cse47 v_prenex_56 (store (select .cse47 v_prenex_56) 0 .cse42))))) (store .cse46 .cse42 (store (select .cse46 .cse42) 0 v_prenex_56))))) (store .cse45 .cse44 (store (select .cse45 .cse44) v_prenex_59 v_prenex_56))))) (store .cse43 v_prenex_56 (store (select .cse43 v_prenex_56) 4 .cse44)))) (= (let ((.cse50 (let ((.cse51 (let ((.cse52 (let ((.cse53 (store .cse54 |c_dll_circular_prepend_#in~head.base| (store .cse55 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse53 v_prenex_56 (store (select .cse53 v_prenex_56) 0 (- 4)))))) (store .cse52 .cse42 (store (select .cse52 .cse42) 0 0))))) (store .cse51 .cse44 (store (select .cse51 .cse44) v_prenex_59 0))))) (store .cse50 v_prenex_56 (store (select .cse50 v_prenex_56) 4 v_prenex_59))) |c_#memory_$Pointer$.offset|))))))) (exists ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (dll_circular_prepend_~new_head~1.base Int)) (let ((.cse62 (store |c_old(#memory_$Pointer$.base)| dll_circular_prepend_~new_head~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_circular_prepend_~new_head~1.base) 0 0) 4 0) 8 v_DerPreprocessor_5)))) (let ((.cse68 (store |c_old(#memory_$Pointer$.offset)| dll_circular_prepend_~new_head~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_circular_prepend_~new_head~1.base) 0 0) 4 0) 8 v_DerPreprocessor_4))) (.cse63 (select .cse62 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse56 (select .cse63 |c_dll_circular_prepend_#in~head.offset|)) (.cse69 (select .cse68 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse57 (select (select .cse62 .cse56) (+ (select .cse69 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (select (select |c_#memory_int| dll_circular_prepend_~new_head~1.base) 8) |c_dll_circular_prepend_#in~data|) (<= (+ |c_#StackHeapBarrier| 1) dll_circular_prepend_~new_head~1.base) (= .cse56 .cse57) (= .cse57 dll_circular_prepend_~new_head~1.base) (= (select |c_old(#valid)| dll_circular_prepend_~new_head~1.base) 0) (= (let ((.cse58 (let ((.cse59 (let ((.cse60 (let ((.cse61 (store .cse62 |c_dll_circular_prepend_#in~head.base| (store .cse63 |c_dll_circular_prepend_#in~head.offset| dll_circular_prepend_~new_head~1.base)))) (store .cse61 dll_circular_prepend_~new_head~1.base (store (select .cse61 dll_circular_prepend_~new_head~1.base) 0 .cse56))))) (store .cse60 .cse56 (store (select .cse60 .cse56) 0 dll_circular_prepend_~new_head~1.base))))) (store .cse59 .cse57 (store (select .cse59 .cse57) 0 dll_circular_prepend_~new_head~1.base))))) (store .cse58 dll_circular_prepend_~new_head~1.base (store (select .cse58 dll_circular_prepend_~new_head~1.base) 4 .cse57))) |c_#memory_$Pointer$.base|) (= (let ((.cse64 (let ((.cse65 (let ((.cse66 (let ((.cse67 (store .cse68 |c_dll_circular_prepend_#in~head.base| (store .cse69 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse67 dll_circular_prepend_~new_head~1.base (store (select .cse67 dll_circular_prepend_~new_head~1.base) 0 (- 4)))))) (store .cse66 .cse56 (store (select .cse66 .cse56) 0 0))))) (store .cse65 .cse57 (store (select .cse65 .cse57) 0 0))))) (store .cse64 dll_circular_prepend_~new_head~1.base (store (select .cse64 dll_circular_prepend_~new_head~1.base) 4 0))) |c_#memory_$Pointer$.offset|))))))) (exists ((v_prenex_49 Int) (v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (let ((.cse76 (store |c_old(#memory_$Pointer$.base)| v_prenex_49 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_49) 0 0) 4 0) 8 v_prenex_50)))) (let ((.cse82 (store |c_old(#memory_$Pointer$.offset)| v_prenex_49 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_49) 0 0) 4 0) 8 v_prenex_51))) (.cse77 (select .cse76 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse74 (select .cse77 |c_dll_circular_prepend_#in~head.offset|)) (.cse83 (select .cse82 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse71 (select (select .cse76 .cse74) (+ (select .cse83 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse70 (let ((.cse72 (let ((.cse73 (let ((.cse75 (store .cse76 |c_dll_circular_prepend_#in~head.base| (store .cse77 |c_dll_circular_prepend_#in~head.offset| v_prenex_49)))) (store .cse75 v_prenex_49 (store (select .cse75 v_prenex_49) 0 .cse74))))) (store .cse73 .cse74 (store (select .cse73 .cse74) 4 v_prenex_49))))) (store .cse72 .cse71 (store (select .cse72 .cse71) v_prenex_52 v_prenex_49))))) (store .cse70 v_prenex_49 (store (select .cse70 v_prenex_49) 4 .cse71)))) (= |c_#memory_$Pointer$.offset| (let ((.cse78 (let ((.cse79 (let ((.cse80 (let ((.cse81 (store .cse82 |c_dll_circular_prepend_#in~head.base| (store .cse83 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse81 v_prenex_49 (store (select .cse81 v_prenex_49) 0 0))))) (store .cse80 .cse74 (store (select .cse80 .cse74) 4 0))))) (store .cse79 .cse71 (store (select .cse79 .cse71) v_prenex_52 0))))) (store .cse78 v_prenex_49 (store (select .cse78 v_prenex_49) 4 v_prenex_52)))) (= (select |c_old(#valid)| v_prenex_49) 0) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_49) (= .cse74 v_prenex_49) (= (select (select |c_#memory_int| v_prenex_49) 8) |c_dll_circular_prepend_#in~data|))))))) (and .cse14 .cse15 .cse16 (exists ((v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse89 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_9))) (let ((.cse88 (select .cse89 |c_dll_circular_prepend_#in~head.offset|)) (.cse93 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_10))) (let ((.cse85 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse89) .cse88) (+ (select .cse93 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse84 (let ((.cse86 (let ((.cse87 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse89 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse88)))) (store .cse87 .cse88 (store (select .cse87 .cse88) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse86 .cse85 (store (select .cse86 .cse85) v_prenex_8 |c_dll_circular_prepend_#in~head.base|))))) (store .cse84 |c_dll_circular_prepend_#in~head.base| (store (select .cse84 |c_dll_circular_prepend_#in~head.base|) 4 .cse85)))) (= |c_#memory_$Pointer$.offset| (let ((.cse90 (let ((.cse91 (let ((.cse92 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse93 |c_dll_circular_prepend_#in~head.offset| 0) 0 (- 4))))) (store .cse92 .cse88 (store (select .cse92 .cse88) 0 0))))) (store .cse91 .cse85 (store (select .cse91 .cse85) v_prenex_8 0))))) (store .cse90 |c_dll_circular_prepend_#in~head.base| (store (select .cse90 |c_dll_circular_prepend_#in~head.base|) 4 v_prenex_8)))) (= |c_dll_circular_prepend_#in~head.base| .cse88))))))) (and .cse14 (exists ((v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (let ((.cse103 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_50))) (let ((.cse98 (select .cse103 |c_dll_circular_prepend_#in~head.offset|)) (.cse99 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_51))) (let ((.cse96 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse103) .cse98) (+ (select .cse99 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (let ((.cse94 (let ((.cse95 (let ((.cse97 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse99 |c_dll_circular_prepend_#in~head.offset| 0) 0 0)))) (store .cse97 .cse98 (store (select .cse97 .cse98) 4 0))))) (store .cse95 .cse96 (store (select .cse95 .cse96) v_prenex_52 0))))) (store .cse94 |c_dll_circular_prepend_#in~head.base| (store (select .cse94 |c_dll_circular_prepend_#in~head.base|) 4 v_prenex_52))) |c_#memory_$Pointer$.offset|) (= |c_dll_circular_prepend_#in~head.base| .cse98) (= |c_#memory_$Pointer$.base| (let ((.cse100 (let ((.cse101 (let ((.cse102 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse103 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse98)))) (store .cse102 .cse98 (store (select .cse102 .cse98) 4 |c_dll_circular_prepend_#in~head.base|))))) (store .cse101 .cse96 (store (select .cse101 .cse96) v_prenex_52 |c_dll_circular_prepend_#in~head.base|))))) (store .cse100 |c_dll_circular_prepend_#in~head.base| (store (select .cse100 |c_dll_circular_prepend_#in~head.base|) 4 .cse96))))))))) .cse15 .cse16) (exists ((v_prenex_23 Int) (v_prenex_25 Int) (v_prenex_24 Int) (dll_circular_prepend_~old_head~0.offset Int)) (let ((.cse111 (store |c_old(#memory_$Pointer$.base)| v_prenex_23 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_23) 0 0) 4 0) 8 v_prenex_24)))) (let ((.cse117 (store |c_old(#memory_$Pointer$.offset)| v_prenex_23 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_23) 0 0) 4 0) 8 v_prenex_25))) (.cse112 (select .cse111 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse109 (select .cse112 |c_dll_circular_prepend_#in~head.offset|)) (.cse118 (select .cse117 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse105 (select (select .cse111 .cse109) (+ (select .cse118 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse107 (+ dll_circular_prepend_~old_head~0.offset 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse104 (let ((.cse106 (let ((.cse108 (let ((.cse110 (store .cse111 |c_dll_circular_prepend_#in~head.base| (store .cse112 |c_dll_circular_prepend_#in~head.offset| v_prenex_23)))) (store .cse110 v_prenex_23 (store (select .cse110 v_prenex_23) 0 .cse109))))) (store .cse108 .cse109 (store (select .cse108 .cse109) .cse107 v_prenex_23))))) (store .cse106 .cse105 (store (select .cse106 .cse105) .cse107 v_prenex_23))))) (store .cse104 v_prenex_23 (store (select .cse104 v_prenex_23) 4 .cse105)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_23) (= .cse109 .cse105) (= (let ((.cse113 (let ((.cse114 (let ((.cse115 (let ((.cse116 (store .cse117 |c_dll_circular_prepend_#in~head.base| (store .cse118 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse116 v_prenex_23 (store (select .cse116 v_prenex_23) 0 dll_circular_prepend_~old_head~0.offset))))) (store .cse115 .cse109 (store (select .cse115 .cse109) .cse107 0))))) (store .cse114 .cse105 (store (select .cse114 .cse105) .cse107 0))))) (store .cse113 v_prenex_23 (store (select .cse113 v_prenex_23) 4 .cse107))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| v_prenex_23) 0) (= (select (select |c_#memory_int| v_prenex_23) 8) |c_dll_circular_prepend_#in~data|))))))) (exists ((v_prenex_48 Int) (v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (let ((.cse126 (store |c_old(#memory_$Pointer$.base)| v_prenex_45 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_45) 0 0) 4 0) 8 v_prenex_46)))) (let ((.cse132 (store |c_old(#memory_$Pointer$.offset)| v_prenex_45 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_45) 0 0) 4 0) 8 v_prenex_47))) (.cse127 (select .cse126 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse123 (select .cse127 |c_dll_circular_prepend_#in~head.offset|)) (.cse133 (select .cse132 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse120 (select (select .cse126 .cse123) (+ (select .cse133 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse124 (+ v_prenex_44 4))) (and (= (select (select |c_#memory_int| v_prenex_45) 8) |c_dll_circular_prepend_#in~data|) (= |c_#memory_$Pointer$.base| (let ((.cse119 (let ((.cse121 (let ((.cse122 (let ((.cse125 (store .cse126 |c_dll_circular_prepend_#in~head.base| (store .cse127 |c_dll_circular_prepend_#in~head.offset| v_prenex_45)))) (store .cse125 v_prenex_45 (store (select .cse125 v_prenex_45) 0 .cse123))))) (store .cse122 .cse123 (store (select .cse122 .cse123) .cse124 v_prenex_45))))) (store .cse121 .cse120 (store (select .cse121 .cse120) v_prenex_48 v_prenex_45))))) (store .cse119 v_prenex_45 (store (select .cse119 v_prenex_45) 4 .cse120)))) (= (select |c_old(#valid)| v_prenex_45) 0) (= (let ((.cse128 (let ((.cse129 (let ((.cse130 (let ((.cse131 (store .cse132 |c_dll_circular_prepend_#in~head.base| (store .cse133 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse131 v_prenex_45 (store (select .cse131 v_prenex_45) 0 v_prenex_44))))) (store .cse130 .cse123 (store (select .cse130 .cse123) .cse124 0))))) (store .cse129 .cse120 (store (select .cse129 .cse120) v_prenex_48 0))))) (store .cse128 v_prenex_45 (store (select .cse128 v_prenex_45) 4 v_prenex_48))) |c_#memory_$Pointer$.offset|) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_45))))))) (and .cse14 .cse15 .cse16 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int)) (let ((.cse140 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_5))) (let ((.cse138 (select .cse140 |c_dll_circular_prepend_#in~head.offset|)) (.cse144 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_6))) (let ((.cse135 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse140) .cse138) (+ (select .cse144 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse139 (+ v_prenex_7 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse134 (let ((.cse136 (let ((.cse137 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse140 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse138)))) (store .cse137 .cse138 (store (select .cse137 .cse138) .cse139 |c_dll_circular_prepend_#in~head.base|))))) (store .cse136 .cse135 (store (select .cse136 .cse135) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse134 |c_dll_circular_prepend_#in~head.base| (store (select .cse134 |c_dll_circular_prepend_#in~head.base|) 4 .cse135)))) (= |c_dll_circular_prepend_#in~head.base| .cse135) (= |c_#memory_$Pointer$.offset| (let ((.cse141 (let ((.cse142 (let ((.cse143 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse144 |c_dll_circular_prepend_#in~head.offset| 0) 0 v_prenex_7)))) (store .cse143 .cse138 (store (select .cse143 .cse138) .cse139 0))))) (store .cse142 .cse135 (store (select .cse142 .cse135) 0 0))))) (store .cse141 |c_dll_circular_prepend_#in~head.base| (store (select .cse141 |c_dll_circular_prepend_#in~head.base|) 4 0)))))))))) (exists ((v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse157 (store |c_old(#memory_$Pointer$.base)| v_prenex_60 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_60) 0 0) 4 0) 8 v_prenex_61)))) (let ((.cse151 (store |c_old(#memory_$Pointer$.offset)| v_prenex_60 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_60) 0 0) 4 0) 8 v_prenex_62))) (.cse158 (select .cse157 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse145 (select .cse158 |c_dll_circular_prepend_#in~head.offset|)) (.cse152 (select .cse151 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse148 (select (select .cse157 .cse145) (+ (select .cse152 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse145 v_prenex_60) (= (let ((.cse146 (let ((.cse147 (let ((.cse149 (let ((.cse150 (store .cse151 |c_dll_circular_prepend_#in~head.base| (store .cse152 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse150 v_prenex_60 (store (select .cse150 v_prenex_60) 0 (- 4)))))) (store .cse149 .cse145 (store (select .cse149 .cse145) 0 0))))) (store .cse147 .cse148 (store (select .cse147 .cse148) 8 0))))) (store .cse146 v_prenex_60 (store (select .cse146 v_prenex_60) 4 8))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse153 (let ((.cse154 (let ((.cse155 (let ((.cse156 (store .cse157 |c_dll_circular_prepend_#in~head.base| (store .cse158 |c_dll_circular_prepend_#in~head.offset| v_prenex_60)))) (store .cse156 v_prenex_60 (store (select .cse156 v_prenex_60) 0 .cse145))))) (store .cse155 .cse145 (store (select .cse155 .cse145) 0 v_prenex_60))))) (store .cse154 .cse148 (store (select .cse154 .cse148) 8 v_prenex_60))))) (store .cse153 v_prenex_60 (store (select .cse153 v_prenex_60) 4 .cse148)))) (= (select |c_old(#valid)| v_prenex_60) 0) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_60) (= .cse148 v_prenex_60))))))) (and .cse14 .cse15 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse168 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_1))) (let ((.cse159 (select .cse168 |c_dll_circular_prepend_#in~head.offset|)) (.cse164 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_2))) (let ((.cse162 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse168) .cse159) (+ (select .cse164 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_dll_circular_prepend_#in~head.base| .cse159) (= (let ((.cse160 (let ((.cse161 (let ((.cse163 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse164 |c_dll_circular_prepend_#in~head.offset| 0) 0 (- 4))))) (store .cse163 .cse159 (store (select .cse163 .cse159) 0 0))))) (store .cse161 .cse162 (store (select .cse161 .cse162) 0 0))))) (store .cse160 |c_dll_circular_prepend_#in~head.base| (store (select .cse160 |c_dll_circular_prepend_#in~head.base|) 4 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse165 (let ((.cse166 (let ((.cse167 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse168 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse159)))) (store .cse167 .cse159 (store (select .cse167 .cse159) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse166 .cse162 (store (select .cse166 .cse162) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse165 |c_dll_circular_prepend_#in~head.base| (store (select .cse165 |c_dll_circular_prepend_#in~head.base|) 4 .cse162)))) (= .cse162 .cse159)))))) .cse16) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int)) (let ((.cse175 (store |c_old(#memory_$Pointer$.base)| v_prenex_16 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_16) 0 0) 4 0) 8 v_prenex_14)))) (let ((.cse181 (store |c_old(#memory_$Pointer$.offset)| v_prenex_16 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_16) 0 0) 4 0) 8 v_prenex_15))) (.cse176 (select .cse175 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse170 (select .cse176 |c_dll_circular_prepend_#in~head.offset|)) (.cse182 (select .cse181 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse169 (select (select .cse175 .cse170) (+ (select .cse182 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse169 v_prenex_16) (= (select |c_old(#valid)| v_prenex_16) 0) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_16) (= .cse170 v_prenex_16) (= |c_#memory_$Pointer$.base| (let ((.cse171 (let ((.cse172 (let ((.cse173 (let ((.cse174 (store .cse175 |c_dll_circular_prepend_#in~head.base| (store .cse176 |c_dll_circular_prepend_#in~head.offset| v_prenex_16)))) (store .cse174 v_prenex_16 (store (select .cse174 v_prenex_16) 0 .cse170))))) (store .cse173 .cse170 (store (select .cse173 .cse170) 8 v_prenex_16))))) (store .cse172 .cse169 (store (select .cse172 .cse169) 0 v_prenex_16))))) (store .cse171 v_prenex_16 (store (select .cse171 v_prenex_16) 4 .cse169)))) (= (let ((.cse177 (let ((.cse178 (let ((.cse179 (let ((.cse180 (store .cse181 |c_dll_circular_prepend_#in~head.base| (store .cse182 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse180 v_prenex_16 (store (select .cse180 v_prenex_16) 0 4))))) (store .cse179 .cse170 (store (select .cse179 .cse170) 8 0))))) (store .cse178 .cse169 (store (select .cse178 .cse169) 0 0))))) (store .cse177 v_prenex_16 (store (select .cse177 v_prenex_16) 4 0))) |c_#memory_$Pointer$.offset|))))))) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse189 (store |c_old(#memory_$Pointer$.base)| v_prenex_13 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_13) 0 0) 4 0) 8 v_prenex_11)))) (let ((.cse195 (store |c_old(#memory_$Pointer$.offset)| v_prenex_13 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_13) 0 0) 4 0) 8 v_prenex_12))) (.cse190 (select .cse189 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse187 (select .cse190 |c_dll_circular_prepend_#in~head.offset|)) (.cse196 (select .cse195 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse184 (select (select .cse189 .cse187) (+ (select .cse196 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (select |c_old(#valid)| v_prenex_13) 0) (= |c_#memory_$Pointer$.base| (let ((.cse183 (let ((.cse185 (let ((.cse186 (let ((.cse188 (store .cse189 |c_dll_circular_prepend_#in~head.base| (store .cse190 |c_dll_circular_prepend_#in~head.offset| v_prenex_13)))) (store .cse188 v_prenex_13 (store (select .cse188 v_prenex_13) 0 .cse187))))) (store .cse186 .cse187 (store (select .cse186 .cse187) 0 v_prenex_13))))) (store .cse185 .cse184 (store (select .cse185 .cse184) 0 v_prenex_13))))) (store .cse183 v_prenex_13 (store (select .cse183 v_prenex_13) 4 .cse184)))) (= .cse187 v_prenex_13) (= (select (select |c_#memory_int| v_prenex_13) 8) |c_dll_circular_prepend_#in~data|) (= |c_#memory_$Pointer$.offset| (let ((.cse191 (let ((.cse192 (let ((.cse193 (let ((.cse194 (store .cse195 |c_dll_circular_prepend_#in~head.base| (store .cse196 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse194 v_prenex_13 (store (select .cse194 v_prenex_13) 0 (- 4)))))) (store .cse193 .cse187 (store (select .cse193 .cse187) 0 0))))) (store .cse192 .cse184 (store (select .cse192 .cse184) 0 0))))) (store .cse191 v_prenex_13 (store (select .cse191 v_prenex_13) 4 0)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_13) (= .cse187 .cse184))))))) (and (exists ((v_prenex_34 Int) (v_prenex_35 Int)) (let ((.cse206 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_34))) (let ((.cse198 (select .cse206 |c_dll_circular_prepend_#in~head.offset|)) (.cse202 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_35))) (let ((.cse197 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse206) .cse198) (+ (select .cse202 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse197 .cse198) (= (let ((.cse199 (let ((.cse200 (let ((.cse201 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse202 |c_dll_circular_prepend_#in~head.offset| 0) 0 (- 4))))) (store .cse201 .cse198 (store (select .cse201 .cse198) 0 0))))) (store .cse200 .cse197 (store (select .cse200 .cse197) 0 0))))) (store .cse199 |c_dll_circular_prepend_#in~head.base| (store (select .cse199 |c_dll_circular_prepend_#in~head.base|) 4 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse203 (let ((.cse204 (let ((.cse205 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse206 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse198)))) (store .cse205 .cse198 (store (select .cse205 .cse198) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse204 .cse197 (store (select .cse204 .cse197) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse203 |c_dll_circular_prepend_#in~head.base| (store (select .cse203 |c_dll_circular_prepend_#in~head.base|) 4 .cse197)))) (= |c_dll_circular_prepend_#in~head.base| .cse197)))))) .cse14 .cse15 .cse16) (and (exists ((v_prenex_4 Int) (v_prenex_33 Int) (v_prenex_3 Int)) (let ((.cse217 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_3))) (let ((.cse212 (select .cse217 |c_dll_circular_prepend_#in~head.offset|)) (.cse213 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_4))) (let ((.cse210 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse217) .cse212) (+ (select .cse213 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse208 (+ v_prenex_33 4))) (and (= |c_#memory_$Pointer$.offset| (let ((.cse207 (let ((.cse209 (let ((.cse211 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse213 |c_dll_circular_prepend_#in~head.offset| 0) 0 v_prenex_33)))) (store .cse211 .cse212 (store (select .cse211 .cse212) .cse208 0))))) (store .cse209 .cse210 (store (select .cse209 .cse210) .cse208 0))))) (store .cse207 |c_dll_circular_prepend_#in~head.base| (store (select .cse207 |c_dll_circular_prepend_#in~head.base|) 4 .cse208)))) (= .cse210 .cse212) (= |c_#memory_$Pointer$.base| (let ((.cse214 (let ((.cse215 (let ((.cse216 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse217 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse212)))) (store .cse216 .cse212 (store (select .cse216 .cse212) .cse208 |c_dll_circular_prepend_#in~head.base|))))) (store .cse215 .cse210 (store (select .cse215 .cse210) .cse208 |c_dll_circular_prepend_#in~head.base|))))) (store .cse214 |c_dll_circular_prepend_#in~head.base| (store (select .cse214 |c_dll_circular_prepend_#in~head.base|) 4 .cse210))))))))) .cse14 .cse15 .cse16) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_39 Int) (v_prenex_36 Int)) (let ((.cse225 (store |c_old(#memory_$Pointer$.base)| v_prenex_37 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_37) 0 0) 4 0) 8 v_prenex_38)))) (let ((.cse231 (store |c_old(#memory_$Pointer$.offset)| v_prenex_37 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_37) 0 0) 4 0) 8 v_prenex_39))) (.cse226 (select .cse225 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse222 (select .cse226 |c_dll_circular_prepend_#in~head.offset|)) (.cse232 (select .cse231 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse223 (+ v_prenex_36 4)) (.cse219 (select (select .cse225 .cse222) (+ (select .cse232 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse218 (let ((.cse220 (let ((.cse221 (let ((.cse224 (store .cse225 |c_dll_circular_prepend_#in~head.base| (store .cse226 |c_dll_circular_prepend_#in~head.offset| v_prenex_37)))) (store .cse224 v_prenex_37 (store (select .cse224 v_prenex_37) 0 .cse222))))) (store .cse221 .cse222 (store (select .cse221 .cse222) .cse223 v_prenex_37))))) (store .cse220 .cse219 (store (select .cse220 .cse219) 8 v_prenex_37))))) (store .cse218 v_prenex_37 (store (select .cse218 v_prenex_37) 4 .cse219)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_37) (= (let ((.cse227 (let ((.cse228 (let ((.cse229 (let ((.cse230 (store .cse231 |c_dll_circular_prepend_#in~head.base| (store .cse232 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse230 v_prenex_37 (store (select .cse230 v_prenex_37) 0 v_prenex_36))))) (store .cse229 .cse222 (store (select .cse229 .cse222) .cse223 0))))) (store .cse228 .cse219 (store (select .cse228 .cse219) 8 0))))) (store .cse227 v_prenex_37 (store (select .cse227 v_prenex_37) 4 8))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| v_prenex_37) 0) (= .cse219 v_prenex_37))))))) (and (exists ((v_prenex_55 Int) (v_prenex_54 Int)) (let ((.cse238 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_54))) (let ((.cse234 (select .cse238 |c_dll_circular_prepend_#in~head.offset|)) (.cse242 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_55))) (let ((.cse233 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse238) .cse234) (+ (select .cse242 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse233 |c_dll_circular_prepend_#in~head.base|) (= .cse234 |c_dll_circular_prepend_#in~head.base|) (= |c_#memory_$Pointer$.base| (let ((.cse235 (let ((.cse236 (let ((.cse237 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse238 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse234)))) (store .cse237 .cse234 (store (select .cse237 .cse234) 4 |c_dll_circular_prepend_#in~head.base|))))) (store .cse236 .cse233 (store (select .cse236 .cse233) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse235 |c_dll_circular_prepend_#in~head.base| (store (select .cse235 |c_dll_circular_prepend_#in~head.base|) 4 .cse233)))) (= (let ((.cse239 (let ((.cse240 (let ((.cse241 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse242 |c_dll_circular_prepend_#in~head.offset| 0) 0 0)))) (store .cse241 .cse234 (store (select .cse241 .cse234) 4 0))))) (store .cse240 .cse233 (store (select .cse240 .cse233) 0 0))))) (store .cse239 |c_dll_circular_prepend_#in~head.base| (store (select .cse239 |c_dll_circular_prepend_#in~head.base|) 4 0))) |c_#memory_$Pointer$.offset|)))))) .cse14 .cse15 .cse16) (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse249 (store |c_old(#memory_$Pointer$.base)| v_prenex_22 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_22) 0 0) 4 0) 8 v_prenex_20)))) (let ((.cse255 (store |c_old(#memory_$Pointer$.offset)| v_prenex_22 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_22) 0 0) 4 0) 8 v_prenex_21))) (.cse250 (select .cse249 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse247 (select .cse250 |c_dll_circular_prepend_#in~head.offset|)) (.cse256 (select .cse255 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse244 (select (select .cse249 .cse247) (+ (select .cse256 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse243 (let ((.cse245 (let ((.cse246 (let ((.cse248 (store .cse249 |c_dll_circular_prepend_#in~head.base| (store .cse250 |c_dll_circular_prepend_#in~head.offset| v_prenex_22)))) (store .cse248 v_prenex_22 (store (select .cse248 v_prenex_22) 0 .cse247))))) (store .cse246 .cse247 (store (select .cse246 .cse247) 8 v_prenex_22))))) (store .cse245 .cse244 (store (select .cse245 .cse244) 8 v_prenex_22))))) (store .cse243 v_prenex_22 (store (select .cse243 v_prenex_22) 4 .cse244)))) (= .cse244 v_prenex_22) (= (select |c_old(#valid)| v_prenex_22) 0) (= (let ((.cse251 (let ((.cse252 (let ((.cse253 (let ((.cse254 (store .cse255 |c_dll_circular_prepend_#in~head.base| (store .cse256 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse254 v_prenex_22 (store (select .cse254 v_prenex_22) 0 4))))) (store .cse253 .cse247 (store (select .cse253 .cse247) 8 0))))) (store .cse252 .cse244 (store (select .cse252 .cse244) 8 0))))) (store .cse251 v_prenex_22 (store (select .cse251 v_prenex_22) 4 8))) |c_#memory_$Pointer$.offset|) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_22) (= .cse247 .cse244))))))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_29 Int) (v_prenex_28 Int)) (let ((.cse270 (store |c_old(#memory_$Pointer$.base)| v_prenex_27 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_27) 0 0) 4 0) 8 v_prenex_28)))) (let ((.cse264 (store |c_old(#memory_$Pointer$.offset)| v_prenex_27 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_27) 0 0) 4 0) 8 v_prenex_29))) (.cse271 (select .cse270 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse261 (select .cse271 |c_dll_circular_prepend_#in~head.offset|)) (.cse265 (select .cse264 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse257 (select (select .cse270 .cse261) (+ (select .cse265 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse262 (+ v_prenex_26 4))) (and (= (select (select |c_#memory_int| v_prenex_27) 8) |c_dll_circular_prepend_#in~data|) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_27) (= .cse257 v_prenex_27) (= (select |c_old(#valid)| v_prenex_27) 0) (= (let ((.cse258 (let ((.cse259 (let ((.cse260 (let ((.cse263 (store .cse264 |c_dll_circular_prepend_#in~head.base| (store .cse265 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse263 v_prenex_27 (store (select .cse263 v_prenex_27) 0 v_prenex_26))))) (store .cse260 .cse261 (store (select .cse260 .cse261) .cse262 0))))) (store .cse259 .cse257 (store (select .cse259 .cse257) 0 0))))) (store .cse258 v_prenex_27 (store (select .cse258 v_prenex_27) 4 0))) |c_#memory_$Pointer$.offset|) (= (let ((.cse266 (let ((.cse267 (let ((.cse268 (let ((.cse269 (store .cse270 |c_dll_circular_prepend_#in~head.base| (store .cse271 |c_dll_circular_prepend_#in~head.offset| v_prenex_27)))) (store .cse269 v_prenex_27 (store (select .cse269 v_prenex_27) 0 .cse261))))) (store .cse268 .cse261 (store (select .cse268 .cse261) .cse262 v_prenex_27))))) (store .cse267 .cse257 (store (select .cse267 .cse257) 0 v_prenex_27))))) (store .cse266 v_prenex_27 (store (select .cse266 v_prenex_27) 4 .cse257))) |c_#memory_$Pointer$.base|))))))) (exists ((v_prenex_49 Int) (v_prenex_51 Int) (v_prenex_50 Int)) (let ((.cse284 (store |c_old(#memory_$Pointer$.base)| v_prenex_49 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_49) 0 0) 4 0) 8 v_prenex_50)))) (let ((.cse278 (store |c_old(#memory_$Pointer$.offset)| v_prenex_49 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_49) 0 0) 4 0) 8 v_prenex_51))) (.cse285 (select .cse284 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse276 (select .cse285 |c_dll_circular_prepend_#in~head.offset|)) (.cse279 (select .cse278 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse272 (select (select .cse284 .cse276) (+ (select .cse279 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse272 v_prenex_49) (= |c_#memory_$Pointer$.offset| (let ((.cse273 (let ((.cse274 (let ((.cse275 (let ((.cse277 (store .cse278 |c_dll_circular_prepend_#in~head.base| (store .cse279 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse277 v_prenex_49 (store (select .cse277 v_prenex_49) 0 0))))) (store .cse275 .cse276 (store (select .cse275 .cse276) 4 0))))) (store .cse274 .cse272 (store (select .cse274 .cse272) 8 0))))) (store .cse273 v_prenex_49 (store (select .cse273 v_prenex_49) 4 8)))) (= (select |c_old(#valid)| v_prenex_49) 0) (= |c_#memory_$Pointer$.base| (let ((.cse280 (let ((.cse281 (let ((.cse282 (let ((.cse283 (store .cse284 |c_dll_circular_prepend_#in~head.base| (store .cse285 |c_dll_circular_prepend_#in~head.offset| v_prenex_49)))) (store .cse283 v_prenex_49 (store (select .cse283 v_prenex_49) 0 .cse276))))) (store .cse282 .cse276 (store (select .cse282 .cse276) 4 v_prenex_49))))) (store .cse281 .cse272 (store (select .cse281 .cse272) 8 v_prenex_49))))) (store .cse280 v_prenex_49 (store (select .cse280 v_prenex_49) 4 .cse272)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_49) (= .cse276 v_prenex_49))))))) (exists ((v_prenex_55 Int) (v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse292 (store |c_old(#memory_$Pointer$.base)| v_prenex_53 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_53) 0 0) 4 0) 8 v_prenex_54)))) (let ((.cse298 (store |c_old(#memory_$Pointer$.offset)| v_prenex_53 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_53) 0 0) 4 0) 8 v_prenex_55))) (.cse293 (select .cse292 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse290 (select .cse293 |c_dll_circular_prepend_#in~head.offset|)) (.cse299 (select .cse298 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse287 (select (select .cse292 .cse290) (+ (select .cse299 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (select (select |c_#memory_int| v_prenex_53) 8) |c_dll_circular_prepend_#in~data|) (= |c_#memory_$Pointer$.base| (let ((.cse286 (let ((.cse288 (let ((.cse289 (let ((.cse291 (store .cse292 |c_dll_circular_prepend_#in~head.base| (store .cse293 |c_dll_circular_prepend_#in~head.offset| v_prenex_53)))) (store .cse291 v_prenex_53 (store (select .cse291 v_prenex_53) 0 .cse290))))) (store .cse289 .cse290 (store (select .cse289 .cse290) 4 v_prenex_53))))) (store .cse288 .cse287 (store (select .cse288 .cse287) 0 v_prenex_53))))) (store .cse286 v_prenex_53 (store (select .cse286 v_prenex_53) 4 .cse287)))) (= .cse287 v_prenex_53) (= (let ((.cse294 (let ((.cse295 (let ((.cse296 (let ((.cse297 (store .cse298 |c_dll_circular_prepend_#in~head.base| (store .cse299 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse297 v_prenex_53 (store (select .cse297 v_prenex_53) 0 0))))) (store .cse296 .cse290 (store (select .cse296 .cse290) 4 0))))) (store .cse295 .cse287 (store (select .cse295 .cse287) 0 0))))) (store .cse294 v_prenex_53 (store (select .cse294 v_prenex_53) 4 0))) |c_#memory_$Pointer$.offset|) (= .cse290 v_prenex_53) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_53) (= (select |c_old(#valid)| v_prenex_53) 0))))))))) is different from false [2019-11-06 21:17:01,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 23 terms [2019-11-06 21:17:02,515 WARN L191 SmtUtils]: Spent 824.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-06 21:17:03,448 WARN L191 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-11-06 21:17:04,664 INFO L235 Elim1Store]: Index analysis took 535 ms [2019-11-06 21:17:04,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:04,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2509 treesize of output 2513 [2019-11-06 21:17:04,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:05,971 INFO L235 Elim1Store]: Index analysis took 1044 ms [2019-11-06 21:17:05,987 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:05,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2444 treesize of output 2474 [2019-11-06 21:17:05,990 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.