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-fea9116 [2019-09-20 13:02:07,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:02:07,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:02:07,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:02:07,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:02:07,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:02:07,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:02:07,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:02:07,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:02:07,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:02:07,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:02:07,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:02:07,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:02:07,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:02:07,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:02:07,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:02:07,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:02:07,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:02:07,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:02:07,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:02:07,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:02:07,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:02:07,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:02:07,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:02:07,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:02:07,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:02:07,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:02:07,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:02:07,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:02:07,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:02:07,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:02:07,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:02:07,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:02:07,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:02:07,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:02:07,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:02:07,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:02:07,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:02:07,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:02:07,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:02:07,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:02:07,564 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-09-20 13:02:07,585 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:02:07,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:02:07,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:02:07,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:02:07,589 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:02:07,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:02:07,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:02:07,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:02:07,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:02:07,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:02:07,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:02:07,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:02:07,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:02:07,592 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:02:07,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:02:07,592 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:02:07,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:02:07,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:02:07,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:02:07,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:02:07,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:02:07,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:02:07,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:02:07,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:02:07,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:02:07,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:02:07,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:02:07,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:02:07,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:02:07,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:02:07,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:02:07,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:02:07,643 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:02:07,644 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:02:07,644 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-09-20 13:02:07,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a58414c2/b1f14ed4482044089545c670f2a62b29/FLAG58efb65bf [2019-09-20 13:02:08,247 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:02:08,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_prepend_unequal.i [2019-09-20 13:02:08,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a58414c2/b1f14ed4482044089545c670f2a62b29/FLAG58efb65bf [2019-09-20 13:02:08,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a58414c2/b1f14ed4482044089545c670f2a62b29 [2019-09-20 13:02:08,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:02:08,553 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:02:08,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:08,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:02:08,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:02:08,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:08" (1/1) ... [2019-09-20 13:02:08,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a05baf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:08, skipping insertion in model container [2019-09-20 13:02:08,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:08" (1/1) ... [2019-09-20 13:02:08,568 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:02:08,624 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:02:09,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:09,110 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:02:09,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:09,215 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:02:09,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:09 WrapperNode [2019-09-20 13:02:09,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:09,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:02:09,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:02:09,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:02:09,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:09" (1/1) ... [2019-09-20 13:02:09,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:09" (1/1) ... [2019-09-20 13:02:09,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:09" (1/1) ... [2019-09-20 13:02:09,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:09" (1/1) ... [2019-09-20 13:02:09,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:09" (1/1) ... [2019-09-20 13:02:09,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:09" (1/1) ... [2019-09-20 13:02:09,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:09" (1/1) ... [2019-09-20 13:02:09,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:02:09,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:02:09,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:02:09,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:02:09,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:09" (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-09-20 13:02:09,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:02:09,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:02:09,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-20 13:02:09,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-20 13:02:09,363 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-20 13:02:09,363 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-09-20 13:02:09,363 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-09-20 13:02:09,364 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-09-20 13:02:09,364 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_prepend [2019-09-20 13:02:09,364 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:02:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:02:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-20 13:02:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-20 13:02:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:02:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:02:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:02:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:02:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:02:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:02:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:02:09,366 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:02:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:02:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:02:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:02:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:02:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:02:09,367 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:02:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:02:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:02:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:02:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:02:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:02:09,368 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:02:09,369 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:02:09,369 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:02:09,369 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:02:09,369 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:02:09,369 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:02:09,369 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:02:09,370 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:02:09,370 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:02:09,370 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:02:09,370 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:02:09,370 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:02:09,370 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:02:09,370 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:02:09,371 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:02:09,371 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:02:09,371 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:02:09,371 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:02:09,371 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:02:09,371 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:02:09,371 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:02:09,372 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:02:09,372 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:02:09,372 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:02:09,372 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:02:09,372 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:02:09,372 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:02:09,373 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:02:09,373 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:02:09,373 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:02:09,373 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:02:09,373 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:02:09,373 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:02:09,373 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:02:09,374 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:02:09,374 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:02:09,374 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:02:09,374 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:02:09,374 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:02:09,374 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:02:09,375 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:02:09,375 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:02:09,375 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:02:09,375 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:02:09,375 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:02:09,375 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:02:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:02:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:02:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:02:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:02:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:02:09,376 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:02:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:02:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:02:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:02:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:02:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:02:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:02:09,377 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:02:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:02:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:02:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:02:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:02:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:02:09,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:02:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:02:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:02:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:02:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:02:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:02:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:02:09,379 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:02:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:02:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:02:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:02:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:02:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:02:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:02:09,380 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:02:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:02:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:02:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:02:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:02:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:02:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-20 13:02:09,381 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-09-20 13:02:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:02:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:02:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:02:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-09-20 13:02:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-09-20 13:02:09,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:02:09,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:02:09,383 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_prepend [2019-09-20 13:02:09,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:02:09,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:02:09,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:02:09,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:02:09,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:02:09,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:02:09,847 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-20 13:02:10,039 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:02:10,039 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-20 13:02:10,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:10 BoogieIcfgContainer [2019-09-20 13:02:10,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:02:10,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:02:10,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:02:10,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:02:10,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:02:08" (1/3) ... [2019-09-20 13:02:10,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c09fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:10, skipping insertion in model container [2019-09-20 13:02:10,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:09" (2/3) ... [2019-09-20 13:02:10,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c09fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:10, skipping insertion in model container [2019-09-20 13:02:10,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:10" (3/3) ... [2019-09-20 13:02:10,064 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2019-09-20 13:02:10,076 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:02:10,087 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:02:10,104 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:02:10,129 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:02:10,129 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:02:10,129 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:02:10,138 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:02:10,138 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:02:10,138 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:02:10,138 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:02:10,139 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:02:10,139 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:02:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2019-09-20 13:02:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:02:10,166 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:10,167 INFO L407 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-09-20 13:02:10,171 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:10,177 INFO L82 PathProgramCache]: Analyzing trace with hash 619880496, now seen corresponding path program 1 times [2019-09-20 13:02:10,179 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:10,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:10,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:02:10,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:10,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:02:10,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:02:10,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:02:10,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:02:10,477 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2019-09-20 13:02:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:10,506 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2019-09-20 13:02:10,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:02:10,508 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2019-09-20 13:02:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:10,518 INFO L225 Difference]: With dead ends: 95 [2019-09-20 13:02:10,518 INFO L226 Difference]: Without dead ends: 40 [2019-09-20 13:02:10,522 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:02:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-20 13:02:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-20 13:02:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-20 13:02:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2019-09-20 13:02:10,564 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2019-09-20 13:02:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:10,566 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-09-20 13:02:10,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:02:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2019-09-20 13:02:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:02:10,569 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:10,569 INFO L407 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-09-20 13:02:10,570 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:10,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1639628125, now seen corresponding path program 1 times [2019-09-20 13:02:10,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:10,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:10,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:02:10,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:10,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:02:10,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:02:10,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:02:10,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:10,754 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 5 states. [2019-09-20 13:02:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:10,837 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2019-09-20 13:02:10,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:02:10,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-09-20 13:02:10,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:10,840 INFO L225 Difference]: With dead ends: 70 [2019-09-20 13:02:10,840 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:02:10,842 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:02:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:02:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2019-09-20 13:02:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-20 13:02:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-09-20 13:02:10,852 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 35 [2019-09-20 13:02:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:10,853 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-09-20 13:02:10,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:02:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-09-20 13:02:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:02:10,854 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:10,855 INFO L407 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-09-20 13:02:10,855 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:10,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1024501097, now seen corresponding path program 1 times [2019-09-20 13:02:10,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:10,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:10,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:11,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:11,430 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:11,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:11,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-20 13:02:11,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:11,830 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-09-20 13:02:11,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:11,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:11,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:02:13,657 WARN L191 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-20 13:02:14,906 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 29 [2019-09-20 13:02:14,928 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:14,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:14,950 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-09-20 13:02:14,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-09-20 13:02:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:19,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:19,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2019-09-20 13:02:19,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-20 13:02:19,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-20 13:02:19,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=531, Unknown=1, NotChecked=0, Total=600 [2019-09-20 13:02:19,134 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 25 states. [2019-09-20 13:02:22,204 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-20 13:02:26,765 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-20 13:02:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:27,506 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-09-20 13:02:27,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 13:02:27,509 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2019-09-20 13:02:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:27,511 INFO L225 Difference]: With dead ends: 77 [2019-09-20 13:02:27,512 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:02:27,514 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=108, Invalid=883, Unknown=1, NotChecked=0, Total=992 [2019-09-20 13:02:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:02:27,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-20 13:02:27,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-20 13:02:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-09-20 13:02:27,533 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 45 [2019-09-20 13:02:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:27,534 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-09-20 13:02:27,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-20 13:02:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-09-20 13:02:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:02:27,539 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:27,539 INFO L407 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-09-20 13:02:27,539 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:27,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1081759399, now seen corresponding path program 1 times [2019-09-20 13:02:27,540 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:27,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:27,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:27,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:28,705 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-20 13:02:28,949 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-20 13:02:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:29,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:29,108 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:29,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:29,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-20 13:02:29,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:29,284 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-09-20 13:02:29,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:29,442 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-09-20 13:02:29,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-09-20 13:02:29,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,590 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-09-20 13:02:29,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,617 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-09-20 13:02:29,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-09-20 13:02:29,786 INFO L341 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2019-09-20 13:02:29,787 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-09-20 13:02:29,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:29,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:29,804 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-09-20 13:02:29,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-09-20 13:02:30,049 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,050 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-09-20 13:02:30,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,070 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_1|], 4=[|v_#memory_$Pointer$.base_BEFORE_CALL_5|]} [2019-09-20 13:02:30,076 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-09-20 13:02:30,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,111 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,111 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-09-20 13:02:30,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,115 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,122 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-09-20 13:02:30,123 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:81, output treesize:10 [2019-09-20 13:02:30,231 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-09-20 13:02:30,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:86 [2019-09-20 13:02:30,700 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-09-20 13:02:30,889 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-09-20 13:02:30,889 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 30 treesize of output 22 [2019-09-20 13:02:30,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 13:02:31,665 WARN L191 SmtUtils]: Spent 773.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-09-20 13:02:31,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,699 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:32,669 WARN L191 SmtUtils]: Spent 969.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-09-20 13:02:32,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:32,689 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:33,738 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 108 [2019-09-20 13:02:33,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:34,245 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-20 13:02:34,246 INFO L341 Elim1Store]: treesize reduction 242, result has 34.2 percent of original size [2019-09-20 13:02:34,247 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 149 treesize of output 141 [2019-09-20 13:02:34,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:34,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:34,249 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:35,158 WARN L191 SmtUtils]: Spent 908.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-09-20 13:02:35,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:35,337 INFO L341 Elim1Store]: treesize reduction 32, result has 66.7 percent of original size [2019-09-20 13:02:35,337 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 156 treesize of output 196 [2019-09-20 13:02:35,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:35,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:35,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:35,342 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:37,083 WARN L191 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 128 DAG size of output: 112 [2019-09-20 13:02:37,084 INFO L567 ElimStorePlain]: treesize reduction 164, result has 85.2 percent of original size [2019-09-20 13:02:37,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:37,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:37,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:37,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:37,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:37,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:37,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:37,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:37,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:37,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:37,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:37,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:37,103 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:38,254 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 108 [2019-09-20 13:02:38,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:38,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:38,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:38,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:38,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:38,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:38,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:38,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:38,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:38,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:38,290 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:02:39,352 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 105 [2019-09-20 13:02:39,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:39,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:39,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:39,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:39,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:39,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:39,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:39,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:39,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:39,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 7 dim-2 vars, End of recursive call: 43 dim-0 vars, and 11 xjuncts. [2019-09-20 13:02:39,426 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:940, output treesize:28422 [2019-09-20 13:02:39,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:39,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:39,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:39,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:41,470 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((dll_circular_prepend_~last~1.offset Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (dll_circular_prepend_~new_head~1.base Int)) (let ((.cse6 (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 ((.cse13 (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))) (.cse7 (select .cse6 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse4 (select .cse7 |c_dll_circular_prepend_#in~head.offset|)) (.cse14 (select .cse13 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse1 (select (select .cse6 .cse4) (+ (select .cse14 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse5 (store .cse6 |c_dll_circular_prepend_#in~head.base| (store .cse7 |c_dll_circular_prepend_#in~head.offset| dll_circular_prepend_~new_head~1.base)))) (store .cse5 dll_circular_prepend_~new_head~1.base (store (select .cse5 dll_circular_prepend_~new_head~1.base) 0 .cse4))))) (store .cse3 .cse4 (store (select .cse3 .cse4) 4 dll_circular_prepend_~new_head~1.base))))) (store .cse2 .cse1 (store (select .cse2 .cse1) dll_circular_prepend_~last~1.offset dll_circular_prepend_~new_head~1.base))))) (store .cse0 dll_circular_prepend_~new_head~1.base (store (select .cse0 dll_circular_prepend_~new_head~1.base) 4 .cse1)))) (or (and (= |c_dll_circular_prepend_#in~head.offset| 8) (= dll_circular_prepend_~new_head~1.base |c_dll_circular_prepend_#in~head.base|)) (let ((.cse8 (select (select |c_#memory_int| dll_circular_prepend_~new_head~1.base) 8))) (and (<= .cse8 |c_dll_circular_prepend_#in~data|) (<= |c_dll_circular_prepend_#in~data| .cse8))) (and (= 8 dll_circular_prepend_~last~1.offset) (= .cse1 dll_circular_prepend_~new_head~1.base))) (<= (+ |c_#StackHeapBarrier| 1) dll_circular_prepend_~new_head~1.base) (= .cse4 dll_circular_prepend_~new_head~1.base) (= (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store .cse13 |c_dll_circular_prepend_#in~head.base| (store .cse14 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse12 dll_circular_prepend_~new_head~1.base (store (select .cse12 dll_circular_prepend_~new_head~1.base) 0 0))))) (store .cse11 .cse4 (store (select .cse11 .cse4) 4 0))))) (store .cse10 .cse1 (store (select .cse10 .cse1) dll_circular_prepend_~last~1.offset 0))))) (store .cse9 dll_circular_prepend_~new_head~1.base (store (select .cse9 dll_circular_prepend_~new_head~1.base) 4 dll_circular_prepend_~last~1.offset))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| dll_circular_prepend_~new_head~1.base) 0))))))) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_36 Int)) (let ((.cse21 (store |c_old(#memory_$Pointer$.base)| v_prenex_36 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_36) 0 0) 4 0) 8 v_prenex_37)))) (let ((.cse28 (store |c_old(#memory_$Pointer$.offset)| v_prenex_36 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_36) 0 0) 4 0) 8 v_prenex_38))) (.cse22 (select .cse21 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse19 (select .cse22 |c_dll_circular_prepend_#in~head.offset|)) (.cse29 (select .cse28 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse16 (select (select .cse21 .cse19) (+ (select .cse29 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse15 (let ((.cse17 (let ((.cse18 (let ((.cse20 (store .cse21 |c_dll_circular_prepend_#in~head.base| (store .cse22 |c_dll_circular_prepend_#in~head.offset| v_prenex_36)))) (store .cse20 v_prenex_36 (store (select .cse20 v_prenex_36) 0 .cse19))))) (store .cse18 .cse19 (store (select .cse18 .cse19) 4 v_prenex_36))))) (store .cse17 .cse16 (store (select .cse17 .cse16) 0 v_prenex_36))))) (store .cse15 v_prenex_36 (store (select .cse15 v_prenex_36) 4 .cse16)))) (= .cse16 v_prenex_36) (or (let ((.cse23 (select (select |c_#memory_int| v_prenex_36) 8))) (and (<= |c_dll_circular_prepend_#in~data| .cse23) (<= .cse23 |c_dll_circular_prepend_#in~data|))) (and (= v_prenex_36 |c_dll_circular_prepend_#in~head.base|) (= |c_dll_circular_prepend_#in~head.offset| 8))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_36) (= .cse19 v_prenex_36) (= |c_#memory_$Pointer$.offset| (let ((.cse24 (let ((.cse25 (let ((.cse26 (let ((.cse27 (store .cse28 |c_dll_circular_prepend_#in~head.base| (store .cse29 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse27 v_prenex_36 (store (select .cse27 v_prenex_36) 0 0))))) (store .cse26 .cse19 (store (select .cse26 .cse19) 4 0))))) (store .cse25 .cse16 (store (select .cse25 .cse16) 0 0))))) (store .cse24 v_prenex_36 (store (select .cse24 v_prenex_36) 4 0)))) (= (select |c_old(#valid)| v_prenex_36) 0))))))) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_32 Int)) (let ((.cse44 (store |c_old(#memory_$Pointer$.base)| v_prenex_33 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_33) 0 0) 4 0) 8 v_prenex_34)))) (let ((.cse38 (store |c_old(#memory_$Pointer$.offset)| v_prenex_33 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_33) 0 0) 4 0) 8 v_prenex_35))) (.cse45 (select .cse44 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse36 (select .cse45 |c_dll_circular_prepend_#in~head.offset|)) (.cse39 (select .cse38 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse32 (+ v_prenex_32 4)) (.cse30 (select (select |c_#memory_int| v_prenex_33) 8)) (.cse34 (select (select .cse44 .cse36) (+ (select .cse39 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (<= |c_dll_circular_prepend_#in~data| .cse30) (= (let ((.cse31 (let ((.cse33 (let ((.cse35 (let ((.cse37 (store .cse38 |c_dll_circular_prepend_#in~head.base| (store .cse39 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse37 v_prenex_33 (store (select .cse37 v_prenex_33) 0 v_prenex_32))))) (store .cse35 .cse36 (store (select .cse35 .cse36) .cse32 0))))) (store .cse33 .cse34 (store (select .cse33 .cse34) .cse32 0))))) (store .cse31 v_prenex_33 (store (select .cse31 v_prenex_33) 4 .cse32))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse40 (let ((.cse41 (let ((.cse42 (let ((.cse43 (store .cse44 |c_dll_circular_prepend_#in~head.base| (store .cse45 |c_dll_circular_prepend_#in~head.offset| v_prenex_33)))) (store .cse43 v_prenex_33 (store (select .cse43 v_prenex_33) 0 .cse36))))) (store .cse42 .cse36 (store (select .cse42 .cse36) .cse32 v_prenex_33))))) (store .cse41 .cse34 (store (select .cse41 .cse34) .cse32 v_prenex_33))))) (store .cse40 v_prenex_33 (store (select .cse40 v_prenex_33) 4 .cse34)))) (<= .cse30 |c_dll_circular_prepend_#in~data|) (= (select |c_old(#valid)| v_prenex_33) 0) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_33) (= .cse36 .cse34))))))) (exists ((v_prenex_18 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse59 (store |c_old(#memory_$Pointer$.base)| v_prenex_18 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_18) 0 0) 4 0) 8 v_prenex_19)))) (let ((.cse52 (store |c_old(#memory_$Pointer$.offset)| v_prenex_18 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_18) 0 0) 4 0) 8 v_prenex_20))) (.cse60 (select .cse59 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse50 (select .cse60 |c_dll_circular_prepend_#in~head.offset|)) (.cse53 (select .cse52 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse54 (select (select |c_#memory_int| v_prenex_18) 8)) (.cse48 (select (select .cse59 .cse50) (+ (select .cse53 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (let ((.cse46 (let ((.cse47 (let ((.cse49 (let ((.cse51 (store .cse52 |c_dll_circular_prepend_#in~head.base| (store .cse53 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse51 v_prenex_18 (store (select .cse51 v_prenex_18) 0 (- 4)))))) (store .cse49 .cse50 (store (select .cse49 .cse50) 0 0))))) (store .cse47 .cse48 (store (select .cse47 .cse48) 0 0))))) (store .cse46 v_prenex_18 (store (select .cse46 v_prenex_18) 4 0))) |c_#memory_$Pointer$.offset|) (<= .cse54 |c_dll_circular_prepend_#in~data|) (<= |c_dll_circular_prepend_#in~data| .cse54) (= |c_#memory_$Pointer$.base| (let ((.cse55 (let ((.cse56 (let ((.cse57 (let ((.cse58 (store .cse59 |c_dll_circular_prepend_#in~head.base| (store .cse60 |c_dll_circular_prepend_#in~head.offset| v_prenex_18)))) (store .cse58 v_prenex_18 (store (select .cse58 v_prenex_18) 0 .cse50))))) (store .cse57 .cse50 (store (select .cse57 .cse50) 0 v_prenex_18))))) (store .cse56 .cse48 (store (select .cse56 .cse48) 0 v_prenex_18))))) (store .cse55 v_prenex_18 (store (select .cse55 v_prenex_18) 4 .cse48)))) (= .cse50 .cse48) (= (select |c_old(#valid)| v_prenex_18) 0) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_18) (= .cse48 v_prenex_18))))))) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int)) (let ((.cse69 (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_23)))) (let ((.cse75 (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_24))) (.cse70 (select .cse69 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse62 (select .cse70 |c_dll_circular_prepend_#in~head.offset|)) (.cse76 (select .cse75 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse63 (select (select .cse69 .cse62) (+ (select .cse76 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse67 (+ v_prenex_21 4))) (and (or (let ((.cse61 (select (select |c_#memory_int| v_prenex_22) 8))) (and (<= .cse61 |c_dll_circular_prepend_#in~data|) (<= |c_dll_circular_prepend_#in~data| .cse61))) (and (= .cse62 v_prenex_22) (= v_prenex_21 4)) (and (= v_prenex_22 |c_dll_circular_prepend_#in~head.base|) (= |c_dll_circular_prepend_#in~head.offset| 8))) (= .cse63 v_prenex_22) (= (select |c_old(#valid)| v_prenex_22) 0) (= |c_#memory_$Pointer$.base| (let ((.cse64 (let ((.cse65 (let ((.cse66 (let ((.cse68 (store .cse69 |c_dll_circular_prepend_#in~head.base| (store .cse70 |c_dll_circular_prepend_#in~head.offset| v_prenex_22)))) (store .cse68 v_prenex_22 (store (select .cse68 v_prenex_22) 0 .cse62))))) (store .cse66 .cse62 (store (select .cse66 .cse62) .cse67 v_prenex_22))))) (store .cse65 .cse63 (store (select .cse65 .cse63) 0 v_prenex_22))))) (store .cse64 v_prenex_22 (store (select .cse64 v_prenex_22) 4 .cse63)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_22) (= (let ((.cse71 (let ((.cse72 (let ((.cse73 (let ((.cse74 (store .cse75 |c_dll_circular_prepend_#in~head.base| (store .cse76 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse74 v_prenex_22 (store (select .cse74 v_prenex_22) 0 v_prenex_21))))) (store .cse73 .cse62 (store (select .cse73 .cse62) .cse67 0))))) (store .cse72 .cse63 (store (select .cse72 .cse63) 0 0))))) (store .cse71 v_prenex_22 (store (select .cse71 v_prenex_22) 4 0))) |c_#memory_$Pointer$.offset|))))))) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (dll_circular_prepend_~old_head~0.offset Int) (v_prenex_8 Int)) (let ((.cse84 (store |c_old(#memory_$Pointer$.base)| v_prenex_8 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_8) 0 0) 4 0) 8 v_prenex_6)))) (let ((.cse91 (store |c_old(#memory_$Pointer$.offset)| v_prenex_8 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_8) 0 0) 4 0) 8 v_prenex_7))) (.cse85 (select .cse84 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse81 (select .cse85 |c_dll_circular_prepend_#in~head.offset|)) (.cse92 (select .cse91 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse78 (select (select .cse84 .cse81) (+ (select .cse92 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse82 (+ dll_circular_prepend_~old_head~0.offset 4))) (and (<= (+ |c_#StackHeapBarrier| 1) v_prenex_8) (= |c_#memory_$Pointer$.base| (let ((.cse77 (let ((.cse79 (let ((.cse80 (let ((.cse83 (store .cse84 |c_dll_circular_prepend_#in~head.base| (store .cse85 |c_dll_circular_prepend_#in~head.offset| v_prenex_8)))) (store .cse83 v_prenex_8 (store (select .cse83 v_prenex_8) 0 .cse81))))) (store .cse80 .cse81 (store (select .cse80 .cse81) .cse82 v_prenex_8))))) (store .cse79 .cse78 (store (select .cse79 .cse78) v_prenex_5 v_prenex_8))))) (store .cse77 v_prenex_8 (store (select .cse77 v_prenex_8) 4 .cse78)))) (= (select |c_old(#valid)| v_prenex_8) 0) (or (and (= |c_dll_circular_prepend_#in~head.offset| 8) (= v_prenex_8 |c_dll_circular_prepend_#in~head.base|)) (let ((.cse86 (select (select |c_#memory_int| v_prenex_8) 8))) (and (<= |c_dll_circular_prepend_#in~data| .cse86) (<= .cse86 |c_dll_circular_prepend_#in~data|))) (and (= .cse78 v_prenex_8) (= 8 v_prenex_5)) (and (= .cse81 v_prenex_8) (= dll_circular_prepend_~old_head~0.offset 4))) (= |c_#memory_$Pointer$.offset| (let ((.cse87 (let ((.cse88 (let ((.cse89 (let ((.cse90 (store .cse91 |c_dll_circular_prepend_#in~head.base| (store .cse92 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse90 v_prenex_8 (store (select .cse90 v_prenex_8) 0 dll_circular_prepend_~old_head~0.offset))))) (store .cse89 .cse81 (store (select .cse89 .cse81) .cse82 0))))) (store .cse88 .cse78 (store (select .cse88 .cse78) v_prenex_5 0))))) (store .cse87 v_prenex_8 (store (select .cse87 v_prenex_8) 4 v_prenex_5)))))))))) (exists ((v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_30 Int) (v_prenex_31 Int)) (let ((.cse99 (store |c_old(#memory_$Pointer$.base)| v_prenex_29 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_29) 0 0) 4 0) 8 v_prenex_30)))) (let ((.cse105 (store |c_old(#memory_$Pointer$.offset)| v_prenex_29 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_29) 0 0) 4 0) 8 v_prenex_31))) (.cse100 (select .cse99 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse97 (select .cse100 |c_dll_circular_prepend_#in~head.offset|)) (.cse106 (select .cse105 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse94 (select (select .cse99 .cse97) (+ (select .cse106 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (<= (+ |c_#StackHeapBarrier| 1) v_prenex_29) (= |c_#memory_$Pointer$.base| (let ((.cse93 (let ((.cse95 (let ((.cse96 (let ((.cse98 (store .cse99 |c_dll_circular_prepend_#in~head.base| (store .cse100 |c_dll_circular_prepend_#in~head.offset| v_prenex_29)))) (store .cse98 v_prenex_29 (store (select .cse98 v_prenex_29) 0 .cse97))))) (store .cse96 .cse97 (store (select .cse96 .cse97) 0 v_prenex_29))))) (store .cse95 .cse94 (store (select .cse95 .cse94) v_prenex_28 v_prenex_29))))) (store .cse93 v_prenex_29 (store (select .cse93 v_prenex_29) 4 .cse94)))) (= (let ((.cse101 (let ((.cse102 (let ((.cse103 (let ((.cse104 (store .cse105 |c_dll_circular_prepend_#in~head.base| (store .cse106 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse104 v_prenex_29 (store (select .cse104 v_prenex_29) 0 (- 4)))))) (store .cse103 .cse97 (store (select .cse103 .cse97) 0 0))))) (store .cse102 .cse94 (store (select .cse102 .cse94) v_prenex_28 0))))) (store .cse101 v_prenex_29 (store (select .cse101 v_prenex_29) 4 v_prenex_28))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| v_prenex_29) 0) (or (and (= .cse94 v_prenex_29) (= 8 v_prenex_28)) (and (= v_prenex_29 |c_dll_circular_prepend_#in~head.base|) (= |c_dll_circular_prepend_#in~head.offset| 8)) (let ((.cse107 (select (select |c_#memory_int| v_prenex_29) 8))) (and (<= .cse107 |c_dll_circular_prepend_#in~data|) (<= |c_dll_circular_prepend_#in~data| .cse107)))) (= .cse97 v_prenex_29))))))) (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse114 (store |c_old(#memory_$Pointer$.base)| v_prenex_14 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_14) 0 0) 4 0) 8 v_prenex_12)))) (let ((.cse121 (store |c_old(#memory_$Pointer$.offset)| v_prenex_14 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_14) 0 0) 4 0) 8 v_prenex_13))) (.cse115 (select .cse114 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse112 (select .cse115 |c_dll_circular_prepend_#in~head.offset|)) (.cse122 (select .cse121 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse116 (select (select |c_#memory_int| v_prenex_14) 8)) (.cse109 (select (select .cse114 .cse112) (+ (select .cse122 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse108 (let ((.cse110 (let ((.cse111 (let ((.cse113 (store .cse114 |c_dll_circular_prepend_#in~head.base| (store .cse115 |c_dll_circular_prepend_#in~head.offset| v_prenex_14)))) (store .cse113 v_prenex_14 (store (select .cse113 v_prenex_14) 0 .cse112))))) (store .cse111 .cse112 (store (select .cse111 .cse112) 0 v_prenex_14))))) (store .cse110 .cse109 (store (select .cse110 .cse109) 0 v_prenex_14))))) (store .cse108 v_prenex_14 (store (select .cse108 v_prenex_14) 4 .cse109)))) (<= .cse116 |c_dll_circular_prepend_#in~data|) (= (select |c_old(#valid)| v_prenex_14) 0) (<= |c_dll_circular_prepend_#in~data| .cse116) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_14) (= .cse112 .cse109) (= (let ((.cse117 (let ((.cse118 (let ((.cse119 (let ((.cse120 (store .cse121 |c_dll_circular_prepend_#in~head.base| (store .cse122 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse120 v_prenex_14 (store (select .cse120 v_prenex_14) 0 (- 4)))))) (store .cse119 .cse112 (store (select .cse119 .cse112) 0 0))))) (store .cse118 .cse109 (store (select .cse118 .cse109) 0 0))))) (store .cse117 v_prenex_14 (store (select .cse117 v_prenex_14) 4 0))) |c_#memory_$Pointer$.offset|) (= .cse112 v_prenex_14))))))) (and (= |c_dll_circular_prepend_#in~head.offset| 8) (<= (+ |c_#StackHeapBarrier| 1) |c_dll_circular_prepend_#in~head.base|) (= (select |c_old(#valid)| |c_dll_circular_prepend_#in~head.base|) 0) (or (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse132 (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 ((.cse123 (select .cse132 |c_dll_circular_prepend_#in~head.offset|)) (.cse128 (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 ((.cse126 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse132) .cse123) (+ (select .cse128 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_dll_circular_prepend_#in~head.base| .cse123) (= (let ((.cse124 (let ((.cse125 (let ((.cse127 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse128 |c_dll_circular_prepend_#in~head.offset| 0) 0 (- 4))))) (store .cse127 .cse123 (store (select .cse127 .cse123) 0 0))))) (store .cse125 .cse126 (store (select .cse125 .cse126) 0 0))))) (store .cse124 |c_dll_circular_prepend_#in~head.base| (store (select .cse124 |c_dll_circular_prepend_#in~head.base|) 4 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse129 (let ((.cse130 (let ((.cse131 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse132 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse123)))) (store .cse131 .cse123 (store (select .cse131 .cse123) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse130 .cse126 (store (select .cse130 .cse126) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse129 |c_dll_circular_prepend_#in~head.base| (store (select .cse129 |c_dll_circular_prepend_#in~head.base|) 4 .cse126)))) (= .cse126 .cse123)))))) (exists ((v_prenex_15 Int) (v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse139 (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 ((.cse138 (select .cse139 |c_dll_circular_prepend_#in~head.offset|)) (.cse143 (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 ((.cse136 (+ v_prenex_15 4)) (.cse134 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse139) .cse138) (+ (select .cse143 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse133 (let ((.cse135 (let ((.cse137 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse139 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse138)))) (store .cse137 .cse138 (store (select .cse137 .cse138) .cse136 |c_dll_circular_prepend_#in~head.base|))))) (store .cse135 .cse134 (store (select .cse135 .cse134) .cse136 |c_dll_circular_prepend_#in~head.base|))))) (store .cse133 |c_dll_circular_prepend_#in~head.base| (store (select .cse133 |c_dll_circular_prepend_#in~head.base|) 4 .cse134)))) (= |c_#memory_$Pointer$.offset| (let ((.cse140 (let ((.cse141 (let ((.cse142 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse143 |c_dll_circular_prepend_#in~head.offset| 0) 0 v_prenex_15)))) (store .cse142 .cse138 (store (select .cse142 .cse138) .cse136 0))))) (store .cse141 .cse134 (store (select .cse141 .cse134) .cse136 0))))) (store .cse140 |c_dll_circular_prepend_#in~head.base| (store (select .cse140 |c_dll_circular_prepend_#in~head.base|) 4 .cse136)))) (= .cse134 .cse138)))))) (exists ((v_prenex_16 Int) (v_prenex_17 Int)) (let ((.cse149 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_16))) (let ((.cse145 (select .cse149 |c_dll_circular_prepend_#in~head.offset|)) (.cse153 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_17))) (let ((.cse144 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse149) .cse145) (+ (select .cse153 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse144 .cse145) (= |c_#memory_$Pointer$.base| (let ((.cse146 (let ((.cse147 (let ((.cse148 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse149 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse145)))) (store .cse148 .cse145 (store (select .cse148 .cse145) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse147 .cse144 (store (select .cse147 .cse144) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse146 |c_dll_circular_prepend_#in~head.base| (store (select .cse146 |c_dll_circular_prepend_#in~head.base|) 4 .cse144)))) (= |c_dll_circular_prepend_#in~head.base| .cse144) (= |c_#memory_$Pointer$.offset| (let ((.cse150 (let ((.cse151 (let ((.cse152 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse153 |c_dll_circular_prepend_#in~head.offset| 0) 0 (- 4))))) (store .cse152 .cse145 (store (select .cse152 .cse145) 0 0))))) (store .cse151 .cse144 (store (select .cse151 .cse144) 0 0))))) (store .cse150 |c_dll_circular_prepend_#in~head.base| (store (select .cse150 |c_dll_circular_prepend_#in~head.base|) 4 0))))))))))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse166 (store |c_old(#memory_$Pointer$.base)| v_prenex_25 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_25) 0 0) 4 0) 8 v_prenex_26)))) (let ((.cse160 (store |c_old(#memory_$Pointer$.offset)| v_prenex_25 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_25) 0 0) 4 0) 8 v_prenex_27))) (.cse167 (select .cse166 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse158 (select .cse167 |c_dll_circular_prepend_#in~head.offset|)) (.cse161 (select .cse160 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse154 (select (select .cse166 .cse158) (+ (select .cse161 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse154 v_prenex_25) (= (let ((.cse155 (let ((.cse156 (let ((.cse157 (let ((.cse159 (store .cse160 |c_dll_circular_prepend_#in~head.base| (store .cse161 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse159 v_prenex_25 (store (select .cse159 v_prenex_25) 0 4))))) (store .cse157 .cse158 (store (select .cse157 .cse158) 8 0))))) (store .cse156 .cse154 (store (select .cse156 .cse154) 8 0))))) (store .cse155 v_prenex_25 (store (select .cse155 v_prenex_25) 4 8))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| v_prenex_25) 0) (= .cse158 .cse154) (= |c_#memory_$Pointer$.base| (let ((.cse162 (let ((.cse163 (let ((.cse164 (let ((.cse165 (store .cse166 |c_dll_circular_prepend_#in~head.base| (store .cse167 |c_dll_circular_prepend_#in~head.offset| v_prenex_25)))) (store .cse165 v_prenex_25 (store (select .cse165 v_prenex_25) 0 .cse158))))) (store .cse164 .cse158 (store (select .cse164 .cse158) 8 v_prenex_25))))) (store .cse163 .cse154 (store (select .cse163 .cse154) 8 v_prenex_25))))) (store .cse162 v_prenex_25 (store (select .cse162 v_prenex_25) 4 .cse154)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_25))))))) (exists ((v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse180 (store |c_old(#memory_$Pointer$.base)| v_prenex_11 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_11) 0 0) 4 0) 8 v_prenex_9)))) (let ((.cse174 (store |c_old(#memory_$Pointer$.offset)| v_prenex_11 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_11) 0 0) 4 0) 8 v_prenex_10))) (.cse181 (select .cse180 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse172 (select .cse181 |c_dll_circular_prepend_#in~head.offset|)) (.cse175 (select .cse174 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse170 (select (select .cse180 .cse172) (+ (select .cse175 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (let ((.cse168 (let ((.cse169 (let ((.cse171 (let ((.cse173 (store .cse174 |c_dll_circular_prepend_#in~head.base| (store .cse175 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse173 v_prenex_11 (store (select .cse173 v_prenex_11) 0 4))))) (store .cse171 .cse172 (store (select .cse171 .cse172) 8 0))))) (store .cse169 .cse170 (store (select .cse169 .cse170) 8 0))))) (store .cse168 v_prenex_11 (store (select .cse168 v_prenex_11) 4 8))) |c_#memory_$Pointer$.offset|) (= .cse172 v_prenex_11) (= .cse172 .cse170) (= (select |c_old(#valid)| v_prenex_11) 0) (= |c_#memory_$Pointer$.base| (let ((.cse176 (let ((.cse177 (let ((.cse178 (let ((.cse179 (store .cse180 |c_dll_circular_prepend_#in~head.base| (store .cse181 |c_dll_circular_prepend_#in~head.offset| v_prenex_11)))) (store .cse179 v_prenex_11 (store (select .cse179 v_prenex_11) 0 .cse172))))) (store .cse178 .cse172 (store (select .cse178 .cse172) 8 v_prenex_11))))) (store .cse177 .cse170 (store (select .cse177 .cse170) 8 v_prenex_11))))) (store .cse176 v_prenex_11 (store (select .cse176 v_prenex_11) 4 .cse170)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_11)))))))) is different from false [2019-09-20 13:02:41,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:41,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:41,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:41,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-20 13:02:41,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:43,585 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse24 (= |c_dll_circular_prepend_#in~head.offset| 8)) (.cse25 (<= (+ |c_#StackHeapBarrier| 1) |c_dll_circular_prepend_#in~head.base|)) (.cse26 (= (select |c_old(#valid)| |c_dll_circular_prepend_#in~head.base|) 0))) (or (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int)) (let ((.cse12 (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_23)))) (let ((.cse6 (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_24))) (.cse13 (select .cse12 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse0 (select .cse13 |c_dll_circular_prepend_#in~head.offset|)) (.cse7 (select .cse6 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse3 (select (select .cse12 .cse0) (+ (select .cse7 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse0 v_prenex_22) (= (let ((.cse1 (let ((.cse2 (let ((.cse4 (let ((.cse5 (store .cse6 |c_dll_circular_prepend_#in~head.base| (store .cse7 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse5 v_prenex_22 (store (select .cse5 v_prenex_22) 0 4))))) (store .cse4 .cse0 (store (select .cse4 .cse0) 8 0))))) (store .cse2 .cse3 (store (select .cse2 .cse3) 0 0))))) (store .cse1 v_prenex_22 (store (select .cse1 v_prenex_22) 4 0))) |c_#memory_$Pointer$.offset|) (= .cse3 v_prenex_22) (= (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| v_prenex_22)))) (store .cse11 v_prenex_22 (store (select .cse11 v_prenex_22) 0 .cse0))))) (store .cse10 .cse0 (store (select .cse10 .cse0) 8 v_prenex_22))))) (store .cse9 .cse3 (store (select .cse9 .cse3) 0 v_prenex_22))))) (store .cse8 v_prenex_22 (store (select .cse8 v_prenex_22) 4 .cse3))) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| v_prenex_22) 0) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_22))))))) (and (exists ((dll_circular_prepend_~last~1.offset Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 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_DerPreprocessor_5))) (let ((.cse18 (select .cse23 |c_dll_circular_prepend_#in~head.offset|)) (.cse19 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_DerPreprocessor_4))) (let ((.cse16 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse23) .cse18) (+ (select .cse19 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (let ((.cse14 (let ((.cse15 (let ((.cse17 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse19 |c_dll_circular_prepend_#in~head.offset| 0) 0 0)))) (store .cse17 .cse18 (store (select .cse17 .cse18) 4 0))))) (store .cse15 .cse16 (store (select .cse15 .cse16) dll_circular_prepend_~last~1.offset 0))))) (store .cse14 |c_dll_circular_prepend_#in~head.base| (store (select .cse14 |c_dll_circular_prepend_#in~head.base|) 4 dll_circular_prepend_~last~1.offset))) |c_#memory_$Pointer$.offset|) (= |c_dll_circular_prepend_#in~head.base| .cse18) (= |c_#memory_$Pointer$.base| (let ((.cse20 (let ((.cse21 (let ((.cse22 (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 .cse18)))) (store .cse22 .cse18 (store (select .cse22 .cse18) 4 |c_dll_circular_prepend_#in~head.base|))))) (store .cse21 .cse16 (store (select .cse21 .cse16) dll_circular_prepend_~last~1.offset |c_dll_circular_prepend_#in~head.base|))))) (store .cse20 |c_dll_circular_prepend_#in~head.base| (store (select .cse20 |c_dll_circular_prepend_#in~head.base|) 4 .cse16))))))))) .cse24 .cse25 .cse26) (exists ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (dll_circular_prepend_~new_head~1.base Int)) (let ((.cse33 (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 ((.cse39 (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))) (.cse34 (select .cse33 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse31 (select .cse34 |c_dll_circular_prepend_#in~head.offset|)) (.cse40 (select .cse39 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse28 (select (select .cse33 .cse31) (+ (select .cse40 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse27 (let ((.cse29 (let ((.cse30 (let ((.cse32 (store .cse33 |c_dll_circular_prepend_#in~head.base| (store .cse34 |c_dll_circular_prepend_#in~head.offset| dll_circular_prepend_~new_head~1.base)))) (store .cse32 dll_circular_prepend_~new_head~1.base (store (select .cse32 dll_circular_prepend_~new_head~1.base) 0 .cse31))))) (store .cse30 .cse31 (store (select .cse30 .cse31) 4 dll_circular_prepend_~new_head~1.base))))) (store .cse29 .cse28 (store (select .cse29 .cse28) 8 dll_circular_prepend_~new_head~1.base))))) (store .cse27 dll_circular_prepend_~new_head~1.base (store (select .cse27 dll_circular_prepend_~new_head~1.base) 4 .cse28)))) (<= (+ |c_#StackHeapBarrier| 1) dll_circular_prepend_~new_head~1.base) (= .cse31 dll_circular_prepend_~new_head~1.base) (= .cse28 dll_circular_prepend_~new_head~1.base) (= (select |c_old(#valid)| dll_circular_prepend_~new_head~1.base) 0) (= (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store .cse39 |c_dll_circular_prepend_#in~head.base| (store .cse40 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse38 dll_circular_prepend_~new_head~1.base (store (select .cse38 dll_circular_prepend_~new_head~1.base) 0 0))))) (store .cse37 .cse31 (store (select .cse37 .cse31) 4 0))))) (store .cse36 .cse28 (store (select .cse36 .cse28) 8 0))))) (store .cse35 dll_circular_prepend_~new_head~1.base (store (select .cse35 dll_circular_prepend_~new_head~1.base) 4 8))) |c_#memory_$Pointer$.offset|))))))) (exists ((v_prenex_29 Int) (v_prenex_28 Int) (v_prenex_30 Int) (v_prenex_31 Int)) (let ((.cse47 (store |c_old(#memory_$Pointer$.base)| v_prenex_29 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_29) 0 0) 4 0) 8 v_prenex_30)))) (let ((.cse53 (store |c_old(#memory_$Pointer$.offset)| v_prenex_29 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_29) 0 0) 4 0) 8 v_prenex_31))) (.cse48 (select .cse47 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse45 (select .cse48 |c_dll_circular_prepend_#in~head.offset|)) (.cse54 (select .cse53 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse42 (select (select .cse47 .cse45) (+ (select .cse54 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse55 (select (select |c_#memory_int| v_prenex_29) 8))) (and (<= (+ |c_#StackHeapBarrier| 1) v_prenex_29) (= |c_#memory_$Pointer$.base| (let ((.cse41 (let ((.cse43 (let ((.cse44 (let ((.cse46 (store .cse47 |c_dll_circular_prepend_#in~head.base| (store .cse48 |c_dll_circular_prepend_#in~head.offset| v_prenex_29)))) (store .cse46 v_prenex_29 (store (select .cse46 v_prenex_29) 0 .cse45))))) (store .cse44 .cse45 (store (select .cse44 .cse45) 0 v_prenex_29))))) (store .cse43 .cse42 (store (select .cse43 .cse42) v_prenex_28 v_prenex_29))))) (store .cse41 v_prenex_29 (store (select .cse41 v_prenex_29) 4 .cse42)))) (= (let ((.cse49 (let ((.cse50 (let ((.cse51 (let ((.cse52 (store .cse53 |c_dll_circular_prepend_#in~head.base| (store .cse54 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse52 v_prenex_29 (store (select .cse52 v_prenex_29) 0 (- 4)))))) (store .cse51 .cse45 (store (select .cse51 .cse45) 0 0))))) (store .cse50 .cse42 (store (select .cse50 .cse42) v_prenex_28 0))))) (store .cse49 v_prenex_29 (store (select .cse49 v_prenex_29) 4 v_prenex_28))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| v_prenex_29) 0) (<= .cse55 |c_dll_circular_prepend_#in~data|) (<= |c_dll_circular_prepend_#in~data| .cse55) (= .cse45 v_prenex_29))))))) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_8 Int)) (let ((.cse68 (store |c_old(#memory_$Pointer$.base)| v_prenex_8 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_8) 0 0) 4 0) 8 v_prenex_6)))) (let ((.cse62 (store |c_old(#memory_$Pointer$.offset)| v_prenex_8 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_8) 0 0) 4 0) 8 v_prenex_7))) (.cse69 (select .cse68 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse60 (select .cse69 |c_dll_circular_prepend_#in~head.offset|)) (.cse63 (select .cse62 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse58 (select (select .cse68 .cse60) (+ (select .cse63 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (let ((.cse56 (let ((.cse57 (let ((.cse59 (let ((.cse61 (store .cse62 |c_dll_circular_prepend_#in~head.base| (store .cse63 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse61 v_prenex_8 (store (select .cse61 v_prenex_8) 0 4))))) (store .cse59 .cse60 (store (select .cse59 .cse60) 8 0))))) (store .cse57 .cse58 (store (select .cse57 .cse58) v_prenex_5 0))))) (store .cse56 v_prenex_8 (store (select .cse56 v_prenex_8) 4 v_prenex_5))) |c_#memory_$Pointer$.offset|) (= (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| v_prenex_8)))) (store .cse67 v_prenex_8 (store (select .cse67 v_prenex_8) 0 .cse60))))) (store .cse66 .cse60 (store (select .cse66 .cse60) 8 v_prenex_8))))) (store .cse65 .cse58 (store (select .cse65 .cse58) v_prenex_5 v_prenex_8))))) (store .cse64 v_prenex_8 (store (select .cse64 v_prenex_8) 4 .cse58))) |c_#memory_$Pointer$.base|) (= .cse60 v_prenex_8) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_8) (= (select |c_old(#valid)| v_prenex_8) 0))))))) (and .cse24 .cse25 (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse79 (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 ((.cse70 (select .cse79 |c_dll_circular_prepend_#in~head.offset|)) (.cse75 (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 ((.cse73 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse79) .cse70) (+ (select .cse75 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_dll_circular_prepend_#in~head.base| .cse70) (= (let ((.cse71 (let ((.cse72 (let ((.cse74 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse75 |c_dll_circular_prepend_#in~head.offset| 0) 0 (- 4))))) (store .cse74 .cse70 (store (select .cse74 .cse70) 0 0))))) (store .cse72 .cse73 (store (select .cse72 .cse73) 0 0))))) (store .cse71 |c_dll_circular_prepend_#in~head.base| (store (select .cse71 |c_dll_circular_prepend_#in~head.base|) 4 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse76 (let ((.cse77 (let ((.cse78 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse79 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse70)))) (store .cse78 .cse70 (store (select .cse78 .cse70) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse77 .cse73 (store (select .cse77 .cse73) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse76 |c_dll_circular_prepend_#in~head.base| (store (select .cse76 |c_dll_circular_prepend_#in~head.base|) 4 .cse73)))) (= .cse73 .cse70)))))) .cse26) (and .cse24 .cse25 .cse26 (exists ((v_prenex_15 Int) (v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse86 (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 ((.cse85 (select .cse86 |c_dll_circular_prepend_#in~head.offset|)) (.cse90 (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 ((.cse83 (+ v_prenex_15 4)) (.cse81 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse86) .cse85) (+ (select .cse90 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse80 (let ((.cse82 (let ((.cse84 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse86 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse85)))) (store .cse84 .cse85 (store (select .cse84 .cse85) .cse83 |c_dll_circular_prepend_#in~head.base|))))) (store .cse82 .cse81 (store (select .cse82 .cse81) .cse83 |c_dll_circular_prepend_#in~head.base|))))) (store .cse80 |c_dll_circular_prepend_#in~head.base| (store (select .cse80 |c_dll_circular_prepend_#in~head.base|) 4 .cse81)))) (= |c_#memory_$Pointer$.offset| (let ((.cse87 (let ((.cse88 (let ((.cse89 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse90 |c_dll_circular_prepend_#in~head.offset| 0) 0 v_prenex_15)))) (store .cse89 .cse85 (store (select .cse89 .cse85) .cse83 0))))) (store .cse88 .cse81 (store (select .cse88 .cse81) .cse83 0))))) (store .cse87 |c_dll_circular_prepend_#in~head.base| (store (select .cse87 |c_dll_circular_prepend_#in~head.base|) 4 .cse83)))) (= .cse81 .cse85))))))) (and .cse24 .cse25 .cse26 (exists ((v_prenex_23 Int) (v_prenex_24 Int) (v_prenex_21 Int)) (let ((.cse97 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_23))) (let ((.cse95 (select .cse97 |c_dll_circular_prepend_#in~head.offset|)) (.cse101 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_24))) (let ((.cse92 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse97) .cse95) (+ (select .cse101 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse96 (+ v_prenex_21 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse91 (let ((.cse93 (let ((.cse94 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse97 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse95)))) (store .cse94 .cse95 (store (select .cse94 .cse95) .cse96 |c_dll_circular_prepend_#in~head.base|))))) (store .cse93 .cse92 (store (select .cse93 .cse92) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse91 |c_dll_circular_prepend_#in~head.base| (store (select .cse91 |c_dll_circular_prepend_#in~head.base|) 4 .cse92)))) (= .cse92 |c_dll_circular_prepend_#in~head.base|) (= |c_#memory_$Pointer$.offset| (let ((.cse98 (let ((.cse99 (let ((.cse100 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse101 |c_dll_circular_prepend_#in~head.offset| 0) 0 v_prenex_21)))) (store .cse100 .cse95 (store (select .cse100 .cse95) .cse96 0))))) (store .cse99 .cse92 (store (select .cse99 .cse92) 0 0))))) (store .cse98 |c_dll_circular_prepend_#in~head.base| (store (select .cse98 |c_dll_circular_prepend_#in~head.base|) 4 0)))))))))) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_36 Int)) (let ((.cse108 (store |c_old(#memory_$Pointer$.base)| v_prenex_36 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_36) 0 0) 4 0) 8 v_prenex_37)))) (let ((.cse115 (store |c_old(#memory_$Pointer$.offset)| v_prenex_36 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_36) 0 0) 4 0) 8 v_prenex_38))) (.cse109 (select .cse108 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse106 (select .cse109 |c_dll_circular_prepend_#in~head.offset|)) (.cse116 (select .cse115 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse110 (select (select |c_#memory_int| v_prenex_36) 8)) (.cse103 (select (select .cse108 .cse106) (+ (select .cse116 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse102 (let ((.cse104 (let ((.cse105 (let ((.cse107 (store .cse108 |c_dll_circular_prepend_#in~head.base| (store .cse109 |c_dll_circular_prepend_#in~head.offset| v_prenex_36)))) (store .cse107 v_prenex_36 (store (select .cse107 v_prenex_36) 0 .cse106))))) (store .cse105 .cse106 (store (select .cse105 .cse106) 4 v_prenex_36))))) (store .cse104 .cse103 (store (select .cse104 .cse103) 0 v_prenex_36))))) (store .cse102 v_prenex_36 (store (select .cse102 v_prenex_36) 4 .cse103)))) (<= |c_dll_circular_prepend_#in~data| .cse110) (= .cse103 v_prenex_36) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_36) (<= .cse110 |c_dll_circular_prepend_#in~data|) (= .cse106 v_prenex_36) (= |c_#memory_$Pointer$.offset| (let ((.cse111 (let ((.cse112 (let ((.cse113 (let ((.cse114 (store .cse115 |c_dll_circular_prepend_#in~head.base| (store .cse116 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse114 v_prenex_36 (store (select .cse114 v_prenex_36) 0 0))))) (store .cse113 .cse106 (store (select .cse113 .cse106) 4 0))))) (store .cse112 .cse103 (store (select .cse112 .cse103) 0 0))))) (store .cse111 v_prenex_36 (store (select .cse111 v_prenex_36) 4 0)))) (= (select |c_old(#valid)| v_prenex_36) 0))))))) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int)) (let ((.cse125 (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_23)))) (let ((.cse131 (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_24))) (.cse126 (select .cse125 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse122 (select .cse126 |c_dll_circular_prepend_#in~head.offset|)) (.cse132 (select .cse131 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse117 (select (select .cse125 .cse122) (+ (select .cse132 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse123 (+ v_prenex_21 4)) (.cse118 (select (select |c_#memory_int| v_prenex_22) 8))) (and (= .cse117 v_prenex_22) (= (select |c_old(#valid)| v_prenex_22) 0) (<= .cse118 |c_dll_circular_prepend_#in~data|) (= |c_#memory_$Pointer$.base| (let ((.cse119 (let ((.cse120 (let ((.cse121 (let ((.cse124 (store .cse125 |c_dll_circular_prepend_#in~head.base| (store .cse126 |c_dll_circular_prepend_#in~head.offset| v_prenex_22)))) (store .cse124 v_prenex_22 (store (select .cse124 v_prenex_22) 0 .cse122))))) (store .cse121 .cse122 (store (select .cse121 .cse122) .cse123 v_prenex_22))))) (store .cse120 .cse117 (store (select .cse120 .cse117) 0 v_prenex_22))))) (store .cse119 v_prenex_22 (store (select .cse119 v_prenex_22) 4 .cse117)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_22) (= (let ((.cse127 (let ((.cse128 (let ((.cse129 (let ((.cse130 (store .cse131 |c_dll_circular_prepend_#in~head.base| (store .cse132 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse130 v_prenex_22 (store (select .cse130 v_prenex_22) 0 v_prenex_21))))) (store .cse129 .cse122 (store (select .cse129 .cse122) .cse123 0))))) (store .cse128 .cse117 (store (select .cse128 .cse117) 0 0))))) (store .cse127 v_prenex_22 (store (select .cse127 v_prenex_22) 4 0))) |c_#memory_$Pointer$.offset|) (<= |c_dll_circular_prepend_#in~data| .cse118))))))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse145 (store |c_old(#memory_$Pointer$.base)| v_prenex_25 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_25) 0 0) 4 0) 8 v_prenex_26)))) (let ((.cse139 (store |c_old(#memory_$Pointer$.offset)| v_prenex_25 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_25) 0 0) 4 0) 8 v_prenex_27))) (.cse146 (select .cse145 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse137 (select .cse146 |c_dll_circular_prepend_#in~head.offset|)) (.cse140 (select .cse139 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse133 (select (select .cse145 .cse137) (+ (select .cse140 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse133 v_prenex_25) (= (let ((.cse134 (let ((.cse135 (let ((.cse136 (let ((.cse138 (store .cse139 |c_dll_circular_prepend_#in~head.base| (store .cse140 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse138 v_prenex_25 (store (select .cse138 v_prenex_25) 0 4))))) (store .cse136 .cse137 (store (select .cse136 .cse137) 8 0))))) (store .cse135 .cse133 (store (select .cse135 .cse133) 8 0))))) (store .cse134 v_prenex_25 (store (select .cse134 v_prenex_25) 4 8))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| v_prenex_25) 0) (= .cse137 .cse133) (= |c_#memory_$Pointer$.base| (let ((.cse141 (let ((.cse142 (let ((.cse143 (let ((.cse144 (store .cse145 |c_dll_circular_prepend_#in~head.base| (store .cse146 |c_dll_circular_prepend_#in~head.offset| v_prenex_25)))) (store .cse144 v_prenex_25 (store (select .cse144 v_prenex_25) 0 .cse137))))) (store .cse143 .cse137 (store (select .cse143 .cse137) 8 v_prenex_25))))) (store .cse142 .cse133 (store (select .cse142 .cse133) 8 v_prenex_25))))) (store .cse141 v_prenex_25 (store (select .cse141 v_prenex_25) 4 .cse133)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_25))))))) (exists ((v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse159 (store |c_old(#memory_$Pointer$.base)| v_prenex_11 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_11) 0 0) 4 0) 8 v_prenex_9)))) (let ((.cse153 (store |c_old(#memory_$Pointer$.offset)| v_prenex_11 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_11) 0 0) 4 0) 8 v_prenex_10))) (.cse160 (select .cse159 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse151 (select .cse160 |c_dll_circular_prepend_#in~head.offset|)) (.cse154 (select .cse153 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse149 (select (select .cse159 .cse151) (+ (select .cse154 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (let ((.cse147 (let ((.cse148 (let ((.cse150 (let ((.cse152 (store .cse153 |c_dll_circular_prepend_#in~head.base| (store .cse154 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse152 v_prenex_11 (store (select .cse152 v_prenex_11) 0 4))))) (store .cse150 .cse151 (store (select .cse150 .cse151) 8 0))))) (store .cse148 .cse149 (store (select .cse148 .cse149) 8 0))))) (store .cse147 v_prenex_11 (store (select .cse147 v_prenex_11) 4 8))) |c_#memory_$Pointer$.offset|) (= .cse151 v_prenex_11) (= .cse151 .cse149) (= (select |c_old(#valid)| v_prenex_11) 0) (= |c_#memory_$Pointer$.base| (let ((.cse155 (let ((.cse156 (let ((.cse157 (let ((.cse158 (store .cse159 |c_dll_circular_prepend_#in~head.base| (store .cse160 |c_dll_circular_prepend_#in~head.offset| v_prenex_11)))) (store .cse158 v_prenex_11 (store (select .cse158 v_prenex_11) 0 .cse151))))) (store .cse157 .cse151 (store (select .cse157 .cse151) 8 v_prenex_11))))) (store .cse156 .cse149 (store (select .cse156 .cse149) 8 v_prenex_11))))) (store .cse155 v_prenex_11 (store (select .cse155 v_prenex_11) 4 .cse149)))) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_11))))))) (and .cse24 (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (let ((.cse170 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_37))) (let ((.cse162 (select .cse170 |c_dll_circular_prepend_#in~head.offset|)) (.cse166 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_38))) (let ((.cse161 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse170) .cse162) (+ (select .cse166 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse161 |c_dll_circular_prepend_#in~head.base|) (= .cse162 |c_dll_circular_prepend_#in~head.base|) (= (let ((.cse163 (let ((.cse164 (let ((.cse165 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse166 |c_dll_circular_prepend_#in~head.offset| 0) 0 0)))) (store .cse165 .cse162 (store (select .cse165 .cse162) 4 0))))) (store .cse164 .cse161 (store (select .cse164 .cse161) 0 0))))) (store .cse163 |c_dll_circular_prepend_#in~head.base| (store (select .cse163 |c_dll_circular_prepend_#in~head.base|) 4 0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse167 (let ((.cse168 (let ((.cse169 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse170 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse162)))) (store .cse169 .cse162 (store (select .cse169 .cse162) 4 |c_dll_circular_prepend_#in~head.base|))))) (store .cse168 .cse161 (store (select .cse168 .cse161) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse167 |c_dll_circular_prepend_#in~head.base| (store (select .cse167 |c_dll_circular_prepend_#in~head.base|) 4 .cse161))))))))) .cse25 .cse26) (exists ((dll_circular_prepend_~last~1.offset Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (dll_circular_prepend_~new_head~1.base Int)) (let ((.cse177 (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 ((.cse183 (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))) (.cse178 (select .cse177 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse175 (select .cse178 |c_dll_circular_prepend_#in~head.offset|)) (.cse184 (select .cse183 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse172 (select (select .cse177 .cse175) (+ (select .cse184 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse185 (select (select |c_#memory_int| dll_circular_prepend_~new_head~1.base) 8))) (and (= |c_#memory_$Pointer$.base| (let ((.cse171 (let ((.cse173 (let ((.cse174 (let ((.cse176 (store .cse177 |c_dll_circular_prepend_#in~head.base| (store .cse178 |c_dll_circular_prepend_#in~head.offset| dll_circular_prepend_~new_head~1.base)))) (store .cse176 dll_circular_prepend_~new_head~1.base (store (select .cse176 dll_circular_prepend_~new_head~1.base) 0 .cse175))))) (store .cse174 .cse175 (store (select .cse174 .cse175) 4 dll_circular_prepend_~new_head~1.base))))) (store .cse173 .cse172 (store (select .cse173 .cse172) dll_circular_prepend_~last~1.offset dll_circular_prepend_~new_head~1.base))))) (store .cse171 dll_circular_prepend_~new_head~1.base (store (select .cse171 dll_circular_prepend_~new_head~1.base) 4 .cse172)))) (<= (+ |c_#StackHeapBarrier| 1) dll_circular_prepend_~new_head~1.base) (= .cse175 dll_circular_prepend_~new_head~1.base) (= (let ((.cse179 (let ((.cse180 (let ((.cse181 (let ((.cse182 (store .cse183 |c_dll_circular_prepend_#in~head.base| (store .cse184 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse182 dll_circular_prepend_~new_head~1.base (store (select .cse182 dll_circular_prepend_~new_head~1.base) 0 0))))) (store .cse181 .cse175 (store (select .cse181 .cse175) 4 0))))) (store .cse180 .cse172 (store (select .cse180 .cse172) dll_circular_prepend_~last~1.offset 0))))) (store .cse179 dll_circular_prepend_~new_head~1.base (store (select .cse179 dll_circular_prepend_~new_head~1.base) 4 dll_circular_prepend_~last~1.offset))) |c_#memory_$Pointer$.offset|) (<= .cse185 |c_dll_circular_prepend_#in~data|) (= (select |c_old(#valid)| dll_circular_prepend_~new_head~1.base) 0) (<= |c_dll_circular_prepend_#in~data| .cse185))))))) (and .cse24 .cse25 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (dll_circular_prepend_~old_head~0.offset Int)) (let ((.cse192 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_6))) (let ((.cse190 (select .cse192 |c_dll_circular_prepend_#in~head.offset|)) (.cse196 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_7))) (let ((.cse187 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse192) .cse190) (+ (select .cse196 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse191 (+ dll_circular_prepend_~old_head~0.offset 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse186 (let ((.cse188 (let ((.cse189 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse192 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse190)))) (store .cse189 .cse190 (store (select .cse189 .cse190) .cse191 |c_dll_circular_prepend_#in~head.base|))))) (store .cse188 .cse187 (store (select .cse188 .cse187) v_prenex_5 |c_dll_circular_prepend_#in~head.base|))))) (store .cse186 |c_dll_circular_prepend_#in~head.base| (store (select .cse186 |c_dll_circular_prepend_#in~head.base|) 4 .cse187)))) (= (let ((.cse193 (let ((.cse194 (let ((.cse195 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse196 |c_dll_circular_prepend_#in~head.offset| 0) 0 dll_circular_prepend_~old_head~0.offset)))) (store .cse195 .cse190 (store (select .cse195 .cse190) .cse191 0))))) (store .cse194 .cse187 (store (select .cse194 .cse187) v_prenex_5 0))))) (store .cse193 |c_dll_circular_prepend_#in~head.base| (store (select .cse193 |c_dll_circular_prepend_#in~head.base|) 4 v_prenex_5))) |c_#memory_$Pointer$.offset|)))))) .cse26) (and .cse24 .cse25 .cse26 (exists ((v_prenex_16 Int) (v_prenex_17 Int)) (let ((.cse202 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_16))) (let ((.cse198 (select .cse202 |c_dll_circular_prepend_#in~head.offset|)) (.cse206 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_17))) (let ((.cse197 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse202) .cse198) (+ (select .cse206 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse197 .cse198) (= |c_#memory_$Pointer$.base| (let ((.cse199 (let ((.cse200 (let ((.cse201 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse202 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse198)))) (store .cse201 .cse198 (store (select .cse201 .cse198) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse200 .cse197 (store (select .cse200 .cse197) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse199 |c_dll_circular_prepend_#in~head.base| (store (select .cse199 |c_dll_circular_prepend_#in~head.base|) 4 .cse197)))) (= |c_dll_circular_prepend_#in~head.base| .cse197) (= |c_#memory_$Pointer$.offset| (let ((.cse203 (let ((.cse204 (let ((.cse205 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse206 |c_dll_circular_prepend_#in~head.offset| 0) 0 (- 4))))) (store .cse205 .cse198 (store (select .cse205 .cse198) 0 0))))) (store .cse204 .cse197 (store (select .cse204 .cse197) 0 0))))) (store .cse203 |c_dll_circular_prepend_#in~head.base| (store (select .cse203 |c_dll_circular_prepend_#in~head.base|) 4 0)))))))))) (and .cse24 .cse25 .cse26 (exists ((v_prenex_28 Int) (v_prenex_30 Int) (v_prenex_31 Int)) (let ((.cse216 (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_30))) (let ((.cse211 (select .cse216 |c_dll_circular_prepend_#in~head.offset|)) (.cse212 (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base|) 0 0) 4 0) 8 v_prenex_31))) (let ((.cse209 (select (select (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| .cse216) .cse211) (+ (select .cse212 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.offset| (let ((.cse207 (let ((.cse208 (let ((.cse210 (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_prepend_#in~head.base| (store (store .cse212 |c_dll_circular_prepend_#in~head.offset| 0) 0 (- 4))))) (store .cse210 .cse211 (store (select .cse210 .cse211) 0 0))))) (store .cse208 .cse209 (store (select .cse208 .cse209) v_prenex_28 0))))) (store .cse207 |c_dll_circular_prepend_#in~head.base| (store (select .cse207 |c_dll_circular_prepend_#in~head.base|) 4 v_prenex_28)))) (= |c_dll_circular_prepend_#in~head.base| .cse211) (= |c_#memory_$Pointer$.base| (let ((.cse213 (let ((.cse214 (let ((.cse215 (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_prepend_#in~head.base| (store (store .cse216 |c_dll_circular_prepend_#in~head.offset| |c_dll_circular_prepend_#in~head.base|) 0 .cse211)))) (store .cse215 .cse211 (store (select .cse215 .cse211) 0 |c_dll_circular_prepend_#in~head.base|))))) (store .cse214 .cse209 (store (select .cse214 .cse209) v_prenex_28 |c_dll_circular_prepend_#in~head.base|))))) (store .cse213 |c_dll_circular_prepend_#in~head.base| (store (select .cse213 |c_dll_circular_prepend_#in~head.base|) 4 .cse209)))))))))) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (dll_circular_prepend_~old_head~0.offset Int) (v_prenex_8 Int)) (let ((.cse225 (store |c_old(#memory_$Pointer$.base)| v_prenex_8 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_8) 0 0) 4 0) 8 v_prenex_6)))) (let ((.cse231 (store |c_old(#memory_$Pointer$.offset)| v_prenex_8 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_8) 0 0) 4 0) 8 v_prenex_7))) (.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 ((.cse217 (select (select |c_#memory_int| v_prenex_8) 8)) (.cse219 (select (select .cse225 .cse222) (+ (select .cse232 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse223 (+ dll_circular_prepend_~old_head~0.offset 4))) (and (<= |c_dll_circular_prepend_#in~data| .cse217) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_8) (= |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_8)))) (store .cse224 v_prenex_8 (store (select .cse224 v_prenex_8) 0 .cse222))))) (store .cse221 .cse222 (store (select .cse221 .cse222) .cse223 v_prenex_8))))) (store .cse220 .cse219 (store (select .cse220 .cse219) v_prenex_5 v_prenex_8))))) (store .cse218 v_prenex_8 (store (select .cse218 v_prenex_8) 4 .cse219)))) (= (select |c_old(#valid)| v_prenex_8) 0) (<= .cse217 |c_dll_circular_prepend_#in~data|) (= |c_#memory_$Pointer$.offset| (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_8 (store (select .cse230 v_prenex_8) 0 dll_circular_prepend_~old_head~0.offset))))) (store .cse229 .cse222 (store (select .cse229 .cse222) .cse223 0))))) (store .cse228 .cse219 (store (select .cse228 .cse219) v_prenex_5 0))))) (store .cse227 v_prenex_8 (store (select .cse227 v_prenex_8) 4 v_prenex_5)))))))))) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_35 Int) (v_prenex_32 Int)) (let ((.cse247 (store |c_old(#memory_$Pointer$.base)| v_prenex_33 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_33) 0 0) 4 0) 8 v_prenex_34)))) (let ((.cse241 (store |c_old(#memory_$Pointer$.offset)| v_prenex_33 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_33) 0 0) 4 0) 8 v_prenex_35))) (.cse248 (select .cse247 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse239 (select .cse248 |c_dll_circular_prepend_#in~head.offset|)) (.cse242 (select .cse241 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse235 (+ v_prenex_32 4)) (.cse233 (select (select |c_#memory_int| v_prenex_33) 8)) (.cse237 (select (select .cse247 .cse239) (+ (select .cse242 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (<= |c_dll_circular_prepend_#in~data| .cse233) (= (let ((.cse234 (let ((.cse236 (let ((.cse238 (let ((.cse240 (store .cse241 |c_dll_circular_prepend_#in~head.base| (store .cse242 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse240 v_prenex_33 (store (select .cse240 v_prenex_33) 0 v_prenex_32))))) (store .cse238 .cse239 (store (select .cse238 .cse239) .cse235 0))))) (store .cse236 .cse237 (store (select .cse236 .cse237) .cse235 0))))) (store .cse234 v_prenex_33 (store (select .cse234 v_prenex_33) 4 .cse235))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse243 (let ((.cse244 (let ((.cse245 (let ((.cse246 (store .cse247 |c_dll_circular_prepend_#in~head.base| (store .cse248 |c_dll_circular_prepend_#in~head.offset| v_prenex_33)))) (store .cse246 v_prenex_33 (store (select .cse246 v_prenex_33) 0 .cse239))))) (store .cse245 .cse239 (store (select .cse245 .cse239) .cse235 v_prenex_33))))) (store .cse244 .cse237 (store (select .cse244 .cse237) .cse235 v_prenex_33))))) (store .cse243 v_prenex_33 (store (select .cse243 v_prenex_33) 4 .cse237)))) (<= .cse233 |c_dll_circular_prepend_#in~data|) (= (select |c_old(#valid)| v_prenex_33) 0) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_33) (= .cse239 .cse237))))))) (exists ((v_prenex_18 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse262 (store |c_old(#memory_$Pointer$.base)| v_prenex_18 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_18) 0 0) 4 0) 8 v_prenex_19)))) (let ((.cse255 (store |c_old(#memory_$Pointer$.offset)| v_prenex_18 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_18) 0 0) 4 0) 8 v_prenex_20))) (.cse263 (select .cse262 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse253 (select .cse263 |c_dll_circular_prepend_#in~head.offset|)) (.cse256 (select .cse255 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse257 (select (select |c_#memory_int| v_prenex_18) 8)) (.cse251 (select (select .cse262 .cse253) (+ (select .cse256 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= (let ((.cse249 (let ((.cse250 (let ((.cse252 (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_18 (store (select .cse254 v_prenex_18) 0 (- 4)))))) (store .cse252 .cse253 (store (select .cse252 .cse253) 0 0))))) (store .cse250 .cse251 (store (select .cse250 .cse251) 0 0))))) (store .cse249 v_prenex_18 (store (select .cse249 v_prenex_18) 4 0))) |c_#memory_$Pointer$.offset|) (<= .cse257 |c_dll_circular_prepend_#in~data|) (<= |c_dll_circular_prepend_#in~data| .cse257) (= |c_#memory_$Pointer$.base| (let ((.cse258 (let ((.cse259 (let ((.cse260 (let ((.cse261 (store .cse262 |c_dll_circular_prepend_#in~head.base| (store .cse263 |c_dll_circular_prepend_#in~head.offset| v_prenex_18)))) (store .cse261 v_prenex_18 (store (select .cse261 v_prenex_18) 0 .cse253))))) (store .cse260 .cse253 (store (select .cse260 .cse253) 0 v_prenex_18))))) (store .cse259 .cse251 (store (select .cse259 .cse251) 0 v_prenex_18))))) (store .cse258 v_prenex_18 (store (select .cse258 v_prenex_18) 4 .cse251)))) (= .cse253 .cse251) (= (select |c_old(#valid)| v_prenex_18) 0) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_18) (= .cse251 v_prenex_18))))))) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (dll_circular_prepend_~old_head~0.offset Int) (v_prenex_8 Int)) (let ((.cse277 (store |c_old(#memory_$Pointer$.base)| v_prenex_8 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_8) 0 0) 4 0) 8 v_prenex_6)))) (let ((.cse271 (store |c_old(#memory_$Pointer$.offset)| v_prenex_8 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_8) 0 0) 4 0) 8 v_prenex_7))) (.cse278 (select .cse277 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse268 (select .cse278 |c_dll_circular_prepend_#in~head.offset|)) (.cse272 (select .cse271 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse264 (select (select .cse277 .cse268) (+ (select .cse272 |c_dll_circular_prepend_#in~head.offset|) 4))) (.cse269 (+ dll_circular_prepend_~old_head~0.offset 4))) (and (= .cse264 v_prenex_8) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_8) (= (select |c_old(#valid)| v_prenex_8) 0) (= |c_#memory_$Pointer$.offset| (let ((.cse265 (let ((.cse266 (let ((.cse267 (let ((.cse270 (store .cse271 |c_dll_circular_prepend_#in~head.base| (store .cse272 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse270 v_prenex_8 (store (select .cse270 v_prenex_8) 0 dll_circular_prepend_~old_head~0.offset))))) (store .cse267 .cse268 (store (select .cse267 .cse268) .cse269 0))))) (store .cse266 .cse264 (store (select .cse266 .cse264) 8 0))))) (store .cse265 v_prenex_8 (store (select .cse265 v_prenex_8) 4 8)))) (= |c_#memory_$Pointer$.base| (let ((.cse273 (let ((.cse274 (let ((.cse275 (let ((.cse276 (store .cse277 |c_dll_circular_prepend_#in~head.base| (store .cse278 |c_dll_circular_prepend_#in~head.offset| v_prenex_8)))) (store .cse276 v_prenex_8 (store (select .cse276 v_prenex_8) 0 .cse268))))) (store .cse275 .cse268 (store (select .cse275 .cse268) .cse269 v_prenex_8))))) (store .cse274 .cse264 (store (select .cse274 .cse264) 8 v_prenex_8))))) (store .cse273 v_prenex_8 (store (select .cse273 v_prenex_8) 4 .cse264)))))))))) (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse285 (store |c_old(#memory_$Pointer$.base)| v_prenex_14 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_14) 0 0) 4 0) 8 v_prenex_12)))) (let ((.cse292 (store |c_old(#memory_$Pointer$.offset)| v_prenex_14 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_14) 0 0) 4 0) 8 v_prenex_13))) (.cse286 (select .cse285 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse283 (select .cse286 |c_dll_circular_prepend_#in~head.offset|)) (.cse293 (select .cse292 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse287 (select (select |c_#memory_int| v_prenex_14) 8)) (.cse280 (select (select .cse285 .cse283) (+ (select .cse293 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse279 (let ((.cse281 (let ((.cse282 (let ((.cse284 (store .cse285 |c_dll_circular_prepend_#in~head.base| (store .cse286 |c_dll_circular_prepend_#in~head.offset| v_prenex_14)))) (store .cse284 v_prenex_14 (store (select .cse284 v_prenex_14) 0 .cse283))))) (store .cse282 .cse283 (store (select .cse282 .cse283) 0 v_prenex_14))))) (store .cse281 .cse280 (store (select .cse281 .cse280) 0 v_prenex_14))))) (store .cse279 v_prenex_14 (store (select .cse279 v_prenex_14) 4 .cse280)))) (<= .cse287 |c_dll_circular_prepend_#in~data|) (= (select |c_old(#valid)| v_prenex_14) 0) (<= |c_dll_circular_prepend_#in~data| .cse287) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_14) (= .cse283 .cse280) (= (let ((.cse288 (let ((.cse289 (let ((.cse290 (let ((.cse291 (store .cse292 |c_dll_circular_prepend_#in~head.base| (store .cse293 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse291 v_prenex_14 (store (select .cse291 v_prenex_14) 0 (- 4)))))) (store .cse290 .cse283 (store (select .cse290 .cse283) 0 0))))) (store .cse289 .cse280 (store (select .cse289 .cse280) 0 0))))) (store .cse288 v_prenex_14 (store (select .cse288 v_prenex_14) 4 0))) |c_#memory_$Pointer$.offset|) (= .cse283 v_prenex_14))))))) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (v_prenex_31 Int)) (let ((.cse300 (store |c_old(#memory_$Pointer$.base)| v_prenex_29 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_29) 0 0) 4 0) 8 v_prenex_30)))) (let ((.cse306 (store |c_old(#memory_$Pointer$.offset)| v_prenex_29 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_29) 0 0) 4 0) 8 v_prenex_31))) (.cse301 (select .cse300 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse295 (select .cse301 |c_dll_circular_prepend_#in~head.offset|)) (.cse307 (select .cse306 |c_dll_circular_prepend_#in~head.base|))) (let ((.cse294 (select (select .cse300 .cse295) (+ (select .cse307 |c_dll_circular_prepend_#in~head.offset|) 4)))) (and (= .cse294 v_prenex_29) (<= (+ |c_#StackHeapBarrier| 1) v_prenex_29) (= (select |c_old(#valid)| v_prenex_29) 0) (= .cse295 v_prenex_29) (= |c_#memory_$Pointer$.base| (let ((.cse296 (let ((.cse297 (let ((.cse298 (let ((.cse299 (store .cse300 |c_dll_circular_prepend_#in~head.base| (store .cse301 |c_dll_circular_prepend_#in~head.offset| v_prenex_29)))) (store .cse299 v_prenex_29 (store (select .cse299 v_prenex_29) 0 .cse295))))) (store .cse298 .cse295 (store (select .cse298 .cse295) 0 v_prenex_29))))) (store .cse297 .cse294 (store (select .cse297 .cse294) 8 v_prenex_29))))) (store .cse296 v_prenex_29 (store (select .cse296 v_prenex_29) 4 .cse294)))) (= (let ((.cse302 (let ((.cse303 (let ((.cse304 (let ((.cse305 (store .cse306 |c_dll_circular_prepend_#in~head.base| (store .cse307 |c_dll_circular_prepend_#in~head.offset| 0)))) (store .cse305 v_prenex_29 (store (select .cse305 v_prenex_29) 0 (- 4)))))) (store .cse304 .cse295 (store (select .cse304 .cse295) 0 0))))) (store .cse303 .cse294 (store (select .cse303 .cse294) 8 0))))) (store .cse302 v_prenex_29 (store (select .cse302 v_prenex_29) 4 8))) |c_#memory_$Pointer$.offset|))))))))) is different from false [2019-09-20 13:02:43,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 23 terms [2019-09-20 13:02:44,565 WARN L191 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-09-20 13:02:45,218 WARN L191 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2019-09-20 13:02:48,398 INFO L235 Elim1Store]: Index analysis took 2564 ms [2019-09-20 13:02:48,417 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:48,418 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 2451 treesize of output 2481 [2019-09-20 13:02:48,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:48,785 INFO L235 Elim1Store]: Index analysis took 195 ms [2019-09-20 13:02:48,790 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:48,790 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 2516 treesize of output 2520 [2019-09-20 13:02:48,792 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:56,251 WARN L191 SmtUtils]: Spent 7.46 s on a formula simplification that was a NOOP. DAG size: 154 [2019-09-20 13:02:56,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:56,258 INFO L392 ElimStorePlain]: Different costs {52=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_10|], 164=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-09-20 13:02:56,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:56,349 INFO L189 IndexEqualityManager]: detected not equals via solver