./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 02:23:10,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 02:23:10,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 02:23:10,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 02:23:10,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 02:23:10,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 02:23:10,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 02:23:10,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 02:23:10,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 02:23:10,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 02:23:10,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 02:23:10,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 02:23:10,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 02:23:10,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 02:23:10,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 02:23:10,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 02:23:10,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 02:23:10,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 02:23:10,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 02:23:10,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 02:23:10,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 02:23:10,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 02:23:10,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 02:23:10,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 02:23:10,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 02:23:10,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 02:23:10,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 02:23:10,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 02:23:10,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 02:23:10,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 02:23:10,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 02:23:10,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 02:23:10,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 02:23:10,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 02:23:10,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 02:23:10,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 02:23:10,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 02:23:10,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 02:23:10,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 02:23:10,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 02:23:10,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 02:23:10,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 02:23:10,572 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 02:23:10,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 02:23:10,573 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 02:23:10,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 02:23:10,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 02:23:10,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 02:23:10,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 02:23:10,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 02:23:10,574 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 02:23:10,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 02:23:10,575 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 02:23:10,575 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 02:23:10,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 02:23:10,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 02:23:10,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 02:23:10,576 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 02:23:10,576 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 02:23:10,576 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 02:23:10,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 02:23:10,576 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 02:23:10,576 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 02:23:10,577 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 02:23:10,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 02:23:10,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 02:23:10,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 02:23:10,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:23:10,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 02:23:10,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 02:23:10,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 02:23:10,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 02:23:10,578 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 02:23:10,578 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 02:23:10,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 02:23:10,578 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 02:23:10,578 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2023-02-14 02:23:10,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 02:23:10,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 02:23:10,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 02:23:10,927 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 02:23:10,927 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 02:23:10,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-02-14 02:23:12,097 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 02:23:12,254 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 02:23:12,254 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-02-14 02:23:12,261 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf4c2689/54dbd28dfa2e4d20bf8fe3c66615e0ca/FLAGac9f16a1d [2023-02-14 02:23:12,270 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf4c2689/54dbd28dfa2e4d20bf8fe3c66615e0ca [2023-02-14 02:23:12,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 02:23:12,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 02:23:12,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 02:23:12,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 02:23:12,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 02:23:12,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef0f47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12, skipping insertion in model container [2023-02-14 02:23:12,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 02:23:12,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 02:23:12,493 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2023-02-14 02:23:12,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:23:12,500 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 02:23:12,598 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2023-02-14 02:23:12,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:23:12,615 INFO L208 MainTranslator]: Completed translation [2023-02-14 02:23:12,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12 WrapperNode [2023-02-14 02:23:12,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 02:23:12,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 02:23:12,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 02:23:12,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 02:23:12,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,665 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2023-02-14 02:23:12,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 02:23:12,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 02:23:12,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 02:23:12,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 02:23:12,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,693 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 02:23:12,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 02:23:12,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 02:23:12,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 02:23:12,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (1/1) ... [2023-02-14 02:23:12,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:23:12,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:23:12,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 02:23:12,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 02:23:12,762 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-14 02:23:12,762 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-14 02:23:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 02:23:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 02:23:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 02:23:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 02:23:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 02:23:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 02:23:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 02:23:12,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 02:23:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 02:23:12,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 02:23:12,834 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 02:23:12,836 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 02:23:12,879 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-14 02:23:13,057 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 02:23:13,062 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 02:23:13,062 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-14 02:23:13,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:23:13 BoogieIcfgContainer [2023-02-14 02:23:13,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 02:23:13,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 02:23:13,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 02:23:13,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 02:23:13,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:23:12" (1/3) ... [2023-02-14 02:23:13,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16697843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:23:13, skipping insertion in model container [2023-02-14 02:23:13,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:23:12" (2/3) ... [2023-02-14 02:23:13,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16697843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:23:13, skipping insertion in model container [2023-02-14 02:23:13,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:23:13" (3/3) ... [2023-02-14 02:23:13,069 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2023-02-14 02:23:13,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 02:23:13,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-02-14 02:23:13,123 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 02:23:13,128 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@62e8d4e5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 02:23:13,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2023-02-14 02:23:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-14 02:23:13,137 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:13,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-14 02:23:13,138 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:13,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2023-02-14 02:23:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:13,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589957690] [2023-02-14 02:23:13,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:13,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:13,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589957690] [2023-02-14 02:23:13,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589957690] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:23:13,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:23:13,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:23:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818755691] [2023-02-14 02:23:13,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:23:13,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:23:13,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:13,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:23:13,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:23:13,370 INFO L87 Difference]: Start difference. First operand has 80 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 78 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:13,490 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2023-02-14 02:23:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:23:13,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-14 02:23:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:13,501 INFO L225 Difference]: With dead ends: 93 [2023-02-14 02:23:13,501 INFO L226 Difference]: Without dead ends: 87 [2023-02-14 02:23:13,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:23:13,507 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 66 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:13,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 62 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-14 02:23:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2023-02-14 02:23:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2023-02-14 02:23:13,543 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 4 [2023-02-14 02:23:13,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:13,544 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2023-02-14 02:23:13,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2023-02-14 02:23:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-14 02:23:13,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:13,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-14 02:23:13,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 02:23:13,545 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2023-02-14 02:23:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:13,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691970186] [2023-02-14 02:23:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:13,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:13,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691970186] [2023-02-14 02:23:13,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691970186] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:23:13,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:23:13,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:23:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827570022] [2023-02-14 02:23:13,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:23:13,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:23:13,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:13,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:23:13,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:23:13,667 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:13,746 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-02-14 02:23:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:23:13,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-14 02:23:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:13,747 INFO L225 Difference]: With dead ends: 66 [2023-02-14 02:23:13,747 INFO L226 Difference]: Without dead ends: 66 [2023-02-14 02:23:13,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:23:13,748 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:13,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 40 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-14 02:23:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-02-14 02:23:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2023-02-14 02:23:13,752 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 4 [2023-02-14 02:23:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:13,752 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2023-02-14 02:23:13,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2023-02-14 02:23:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 02:23:13,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:13,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:13,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 02:23:13,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash -401980428, now seen corresponding path program 1 times [2023-02-14 02:23:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:13,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022115357] [2023-02-14 02:23:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:13,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:13,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:13,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022115357] [2023-02-14 02:23:13,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022115357] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:23:13,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:23:13,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:23:13,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588638716] [2023-02-14 02:23:13,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:23:13,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:23:13,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:13,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:23:13,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:23:13,836 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:13,916 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2023-02-14 02:23:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:23:13,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 02:23:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:13,918 INFO L225 Difference]: With dead ends: 108 [2023-02-14 02:23:13,920 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 02:23:13,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:23:13,922 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 53 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:13,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 118 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 02:23:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 64. [2023-02-14 02:23:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2023-02-14 02:23:13,931 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 10 [2023-02-14 02:23:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:13,931 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2023-02-14 02:23:13,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2023-02-14 02:23:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 02:23:13,932 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:13,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:13,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 02:23:13,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:13,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash -401980427, now seen corresponding path program 1 times [2023-02-14 02:23:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:13,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655176113] [2023-02-14 02:23:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:14,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:14,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655176113] [2023-02-14 02:23:14,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655176113] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:23:14,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:23:14,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:23:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054096796] [2023-02-14 02:23:14,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:23:14,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:23:14,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:14,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:23:14,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:23:14,069 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:14,151 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2023-02-14 02:23:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:23:14,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 02:23:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:14,152 INFO L225 Difference]: With dead ends: 110 [2023-02-14 02:23:14,153 INFO L226 Difference]: Without dead ends: 110 [2023-02-14 02:23:14,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:23:14,162 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 56 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:14,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 127 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-14 02:23:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 62. [2023-02-14 02:23:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 61 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2023-02-14 02:23:14,167 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 10 [2023-02-14 02:23:14,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:14,167 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2023-02-14 02:23:14,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2023-02-14 02:23:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 02:23:14,168 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:14,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:14,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 02:23:14,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:14,169 INFO L85 PathProgramCache]: Analyzing trace with hash -401981869, now seen corresponding path program 1 times [2023-02-14 02:23:14,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:14,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730134718] [2023-02-14 02:23:14,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:14,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:14,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:14,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730134718] [2023-02-14 02:23:14,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730134718] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:23:14,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:23:14,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:23:14,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621282512] [2023-02-14 02:23:14,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:23:14,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:23:14,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:14,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:23:14,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:23:14,229 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:14,234 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2023-02-14 02:23:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:23:14,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 02:23:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:14,235 INFO L225 Difference]: With dead ends: 70 [2023-02-14 02:23:14,236 INFO L226 Difference]: Without dead ends: 70 [2023-02-14 02:23:14,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:23:14,237 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:14,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:23:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-14 02:23:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2023-02-14 02:23:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.65) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2023-02-14 02:23:14,245 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 10 [2023-02-14 02:23:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:14,245 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2023-02-14 02:23:14,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2023-02-14 02:23:14,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 02:23:14,246 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:14,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:14,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 02:23:14,247 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:14,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:14,247 INFO L85 PathProgramCache]: Analyzing trace with hash 243865783, now seen corresponding path program 1 times [2023-02-14 02:23:14,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:14,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517622374] [2023-02-14 02:23:14,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:14,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:14,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:14,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517622374] [2023-02-14 02:23:14,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517622374] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:23:14,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:23:14,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:23:14,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254750099] [2023-02-14 02:23:14,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:23:14,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:23:14,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:14,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:23:14,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:23:14,351 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:14,437 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2023-02-14 02:23:14,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:23:14,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-14 02:23:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:14,440 INFO L225 Difference]: With dead ends: 85 [2023-02-14 02:23:14,440 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 02:23:14,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:23:14,443 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 148 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:14,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 62 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 02:23:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2023-02-14 02:23:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-02-14 02:23:14,457 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2023-02-14 02:23:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:14,457 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-02-14 02:23:14,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-02-14 02:23:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 02:23:14,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:14,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:14,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 02:23:14,459 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash 243865784, now seen corresponding path program 1 times [2023-02-14 02:23:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:14,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799456397] [2023-02-14 02:23:14,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:14,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:14,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799456397] [2023-02-14 02:23:14,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799456397] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:23:14,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:23:14,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:23:14,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992852128] [2023-02-14 02:23:14,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:23:14,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:23:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:14,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:23:14,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:23:14,601 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:14,694 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2023-02-14 02:23:14,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:23:14,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-14 02:23:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:14,695 INFO L225 Difference]: With dead ends: 85 [2023-02-14 02:23:14,695 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 02:23:14,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:23:14,695 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 85 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:14,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 84 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 02:23:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2023-02-14 02:23:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2023-02-14 02:23:14,698 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 12 [2023-02-14 02:23:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:14,698 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2023-02-14 02:23:14,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2023-02-14 02:23:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 02:23:14,698 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:14,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:14,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 02:23:14,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:14,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash -27720857, now seen corresponding path program 1 times [2023-02-14 02:23:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:14,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802151365] [2023-02-14 02:23:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:14,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:14,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802151365] [2023-02-14 02:23:14,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802151365] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:23:14,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792667093] [2023-02-14 02:23:14,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:14,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:23:14,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:23:14,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:23:14,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 02:23:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:14,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 02:23:14,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:23:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:14,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:23:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:14,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792667093] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:23:14,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:23:14,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-14 02:23:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890988529] [2023-02-14 02:23:14,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:23:14,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:23:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:23:14,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:23:14,993 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:15,006 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2023-02-14 02:23:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:23:15,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 02:23:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:15,007 INFO L225 Difference]: With dead ends: 85 [2023-02-14 02:23:15,007 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 02:23:15,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:23:15,008 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 18 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:15,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 231 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:23:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 02:23:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-02-14 02:23:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2023-02-14 02:23:15,011 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 16 [2023-02-14 02:23:15,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:15,011 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2023-02-14 02:23:15,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2023-02-14 02:23:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 02:23:15,012 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:15,012 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:15,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 02:23:15,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:23:15,218 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash -868554549, now seen corresponding path program 1 times [2023-02-14 02:23:15,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:15,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580430812] [2023-02-14 02:23:15,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:15,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:15,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:15,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580430812] [2023-02-14 02:23:15,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580430812] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:23:15,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244138828] [2023-02-14 02:23:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:15,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:23:15,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:23:15,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:23:15,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 02:23:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:15,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 02:23:15,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:23:15,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:23:15,482 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 02:23:15,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 02:23:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:15,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:23:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:15,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244138828] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:23:15,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:23:15,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-02-14 02:23:15,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93179653] [2023-02-14 02:23:15,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:23:15,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:23:15,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:15,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:23:15,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:23:15,565 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:15,632 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2023-02-14 02:23:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 02:23:15,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-14 02:23:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:15,633 INFO L225 Difference]: With dead ends: 96 [2023-02-14 02:23:15,633 INFO L226 Difference]: Without dead ends: 96 [2023-02-14 02:23:15,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-14 02:23:15,633 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 91 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:15,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 114 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-14 02:23:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 79. [2023-02-14 02:23:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-02-14 02:23:15,636 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 18 [2023-02-14 02:23:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:15,636 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-02-14 02:23:15,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-02-14 02:23:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 02:23:15,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:15,637 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:15,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 02:23:15,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-02-14 02:23:15,843 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash -868554548, now seen corresponding path program 1 times [2023-02-14 02:23:15,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:15,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588671075] [2023-02-14 02:23:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:15,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:15,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588671075] [2023-02-14 02:23:15,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588671075] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:23:15,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16407409] [2023-02-14 02:23:15,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:15,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:23:15,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:23:15,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:23:16,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 02:23:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:16,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 02:23:16,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:23:16,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:23:16,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:23:16,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:16,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 02:23:16,212 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:23:16,213 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2023-02-14 02:23:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:16,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:23:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:18,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16407409] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:23:18,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:23:18,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2023-02-14 02:23:18,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584414406] [2023-02-14 02:23:18,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:23:18,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 02:23:18,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:18,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 02:23:18,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-14 02:23:18,411 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:18,633 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2023-02-14 02:23:18,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:23:18,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-14 02:23:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:18,634 INFO L225 Difference]: With dead ends: 94 [2023-02-14 02:23:18,634 INFO L226 Difference]: Without dead ends: 94 [2023-02-14 02:23:18,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-02-14 02:23:18,635 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 289 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:18,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 73 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-14 02:23:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2023-02-14 02:23:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 76 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2023-02-14 02:23:18,638 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 18 [2023-02-14 02:23:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:18,638 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2023-02-14 02:23:18,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2023-02-14 02:23:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 02:23:18,639 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:18,639 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:18,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 02:23:18,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:23:18,845 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:18,845 INFO L85 PathProgramCache]: Analyzing trace with hash 140768543, now seen corresponding path program 1 times [2023-02-14 02:23:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:18,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189382424] [2023-02-14 02:23:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:18,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-14 02:23:18,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:18,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189382424] [2023-02-14 02:23:18,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189382424] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:23:18,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:23:18,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:23:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824694758] [2023-02-14 02:23:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:23:18,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:23:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:23:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:23:18,996 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:19,102 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2023-02-14 02:23:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:23:19,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-14 02:23:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:19,103 INFO L225 Difference]: With dead ends: 90 [2023-02-14 02:23:19,103 INFO L226 Difference]: Without dead ends: 90 [2023-02-14 02:23:19,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 02:23:19,104 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 149 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:19,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 76 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-14 02:23:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2023-02-14 02:23:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2023-02-14 02:23:19,106 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 37 [2023-02-14 02:23:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:19,107 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2023-02-14 02:23:19,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2023-02-14 02:23:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 02:23:19,107 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:19,108 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:19,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 02:23:19,108 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:19,108 INFO L85 PathProgramCache]: Analyzing trace with hash 140768544, now seen corresponding path program 1 times [2023-02-14 02:23:19,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:19,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609794559] [2023-02-14 02:23:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:19,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-14 02:23:19,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:19,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609794559] [2023-02-14 02:23:19,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609794559] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:23:19,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:23:19,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:23:19,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534974176] [2023-02-14 02:23:19,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:23:19,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:23:19,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:19,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:23:19,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:23:19,281 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:19,395 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2023-02-14 02:23:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:23:19,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-14 02:23:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:19,396 INFO L225 Difference]: With dead ends: 80 [2023-02-14 02:23:19,396 INFO L226 Difference]: Without dead ends: 80 [2023-02-14 02:23:19,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 02:23:19,397 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 157 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:19,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 54 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-14 02:23:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2023-02-14 02:23:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-14 02:23:19,398 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 37 [2023-02-14 02:23:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:19,399 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-14 02:23:19,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-14 02:23:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 02:23:19,399 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:19,399 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:19,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 02:23:19,399 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:19,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2134585018, now seen corresponding path program 1 times [2023-02-14 02:23:19,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:19,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370214093] [2023-02-14 02:23:19,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:19,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-14 02:23:19,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:19,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370214093] [2023-02-14 02:23:19,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370214093] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:23:19,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539544466] [2023-02-14 02:23:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:19,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:23:19,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:23:19,922 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:23:19,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 02:23:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:20,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-14 02:23:20,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:23:20,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:23:20,255 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:23:20,255 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2023-02-14 02:23:20,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:23:20,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:23:20,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:20,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 02:23:20,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:20,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 02:23:20,460 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-14 02:23:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:23:20,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:23:20,554 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 Int) (v_ArrVal_909 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_909))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4) v_ArrVal_911))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2023-02-14 02:23:20,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:20,561 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2023-02-14 02:23:20,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:20,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 218 treesize of output 214 [2023-02-14 02:23:20,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 234 [2023-02-14 02:23:20,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2023-02-14 02:23:20,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-02-14 02:23:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 3 not checked. [2023-02-14 02:23:20,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539544466] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:23:20,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:23:20,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2023-02-14 02:23:20,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827348316] [2023-02-14 02:23:20,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:23:20,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-14 02:23:20,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:20,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-14 02:23:20,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=778, Unknown=1, NotChecked=56, Total=930 [2023-02-14 02:23:20,955 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:21,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:21,626 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2023-02-14 02:23:21,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 02:23:21,627 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-14 02:23:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:21,627 INFO L225 Difference]: With dead ends: 92 [2023-02-14 02:23:21,627 INFO L226 Difference]: Without dead ends: 92 [2023-02-14 02:23:21,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=382, Invalid=1427, Unknown=1, NotChecked=82, Total=1892 [2023-02-14 02:23:21,628 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 354 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 29 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:21,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 363 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 496 Invalid, 12 Unknown, 82 Unchecked, 0.2s Time] [2023-02-14 02:23:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-14 02:23:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2023-02-14 02:23:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 76 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2023-02-14 02:23:21,630 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 39 [2023-02-14 02:23:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:21,630 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2023-02-14 02:23:21,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2023-02-14 02:23:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 02:23:21,631 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:21,631 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:21,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-14 02:23:21,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:23:21,837 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:21,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:21,838 INFO L85 PathProgramCache]: Analyzing trace with hash -56889687, now seen corresponding path program 1 times [2023-02-14 02:23:21,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:21,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697503585] [2023-02-14 02:23:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-14 02:23:21,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:21,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697503585] [2023-02-14 02:23:21,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697503585] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:23:21,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:23:21,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 02:23:21,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229566158] [2023-02-14 02:23:21,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:23:21,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 02:23:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:21,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 02:23:21,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 02:23:21,963 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:22,074 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2023-02-14 02:23:22,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 02:23:22,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-14 02:23:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:22,075 INFO L225 Difference]: With dead ends: 92 [2023-02-14 02:23:22,075 INFO L226 Difference]: Without dead ends: 92 [2023-02-14 02:23:22,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-02-14 02:23:22,076 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 179 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:22,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 85 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-14 02:23:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2023-02-14 02:23:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2023-02-14 02:23:22,077 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 43 [2023-02-14 02:23:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:22,077 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2023-02-14 02:23:22,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2023-02-14 02:23:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 02:23:22,078 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:22,078 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:22,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 02:23:22,078 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:22,078 INFO L85 PathProgramCache]: Analyzing trace with hash -56889686, now seen corresponding path program 1 times [2023-02-14 02:23:22,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:22,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950154558] [2023-02-14 02:23:22,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:22,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-14 02:23:22,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:22,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950154558] [2023-02-14 02:23:22,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950154558] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:23:22,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:23:22,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 02:23:22,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062320193] [2023-02-14 02:23:22,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:23:22,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 02:23:22,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:22,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 02:23:22,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 02:23:22,311 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:22,442 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2023-02-14 02:23:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:23:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-14 02:23:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:22,443 INFO L225 Difference]: With dead ends: 76 [2023-02-14 02:23:22,443 INFO L226 Difference]: Without dead ends: 76 [2023-02-14 02:23:22,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-14 02:23:22,444 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 154 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:22,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 77 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:23:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-14 02:23:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2023-02-14 02:23:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2023-02-14 02:23:22,445 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 43 [2023-02-14 02:23:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:22,445 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2023-02-14 02:23:22,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2023-02-14 02:23:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 02:23:22,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:22,446 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:22,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-14 02:23:22,446 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:22,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash -56889649, now seen corresponding path program 1 times [2023-02-14 02:23:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:22,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962079442] [2023-02-14 02:23:22,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:22,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:23:23,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:23,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962079442] [2023-02-14 02:23:23,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962079442] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:23:23,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681123621] [2023-02-14 02:23:23,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:23,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:23:23,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:23:23,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:23:23,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 02:23:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:23,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-14 02:23:23,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:23:23,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:23:23,441 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:23:23,441 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2023-02-14 02:23:23,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2023-02-14 02:23:23,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:23,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 02:23:23,508 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:23:23,509 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-14 02:23:23,568 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:23:23,575 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-14 02:23:23,575 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 30 [2023-02-14 02:23:23,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:23,621 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:23:23,623 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:23:23,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2023-02-14 02:23:23,822 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:23:23,822 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 64 [2023-02-14 02:23:23,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:23,846 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 47 [2023-02-14 02:23:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:23:23,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:23:24,037 INFO L321 Elim1Store]: treesize reduction 18, result has 73.9 percent of original size [2023-02-14 02:23:24,037 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 62 [2023-02-14 02:23:24,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:24,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 69 [2023-02-14 02:23:24,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:24,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 317 treesize of output 307 [2023-02-14 02:23:24,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 291 [2023-02-14 02:23:24,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 155 [2023-02-14 02:23:24,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 149 [2023-02-14 02:23:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:23:24,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681123621] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:23:24,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:23:24,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 38 [2023-02-14 02:23:24,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954407662] [2023-02-14 02:23:24,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:23:24,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-14 02:23:24,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:24,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-14 02:23:24,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1330, Unknown=6, NotChecked=0, Total=1482 [2023-02-14 02:23:24,550 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:25,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:25,979 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2023-02-14 02:23:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 02:23:25,980 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-14 02:23:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:25,980 INFO L225 Difference]: With dead ends: 100 [2023-02-14 02:23:25,980 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 02:23:25,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=554, Invalid=2520, Unknown=6, NotChecked=0, Total=3080 [2023-02-14 02:23:25,981 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 443 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:25,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 339 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 02:23:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 02:23:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 76. [2023-02-14 02:23:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-02-14 02:23:25,983 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 43 [2023-02-14 02:23:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:25,983 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-02-14 02:23:25,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-02-14 02:23:25,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 02:23:25,984 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:25,984 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:26,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 02:23:26,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-14 02:23:26,191 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:26,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash -56889648, now seen corresponding path program 1 times [2023-02-14 02:23:26,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:26,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101286856] [2023-02-14 02:23:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:23:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:27,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101286856] [2023-02-14 02:23:27,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101286856] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:23:27,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035610455] [2023-02-14 02:23:27,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:27,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:23:27,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:23:27,211 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:23:27,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 02:23:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:27,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-14 02:23:27,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:23:27,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:23:27,458 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:23:27,459 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2023-02-14 02:23:27,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2023-02-14 02:23:27,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2023-02-14 02:23:27,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:27,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 02:23:27,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:27,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 02:23:27,554 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:23:27,555 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2023-02-14 02:23:27,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2023-02-14 02:23:27,640 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:23:27,648 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-14 02:23:27,648 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 38 [2023-02-14 02:23:27,652 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:23:27,659 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-14 02:23:27,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 31 [2023-02-14 02:23:27,766 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:23:27,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:27,771 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:23:27,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 94 [2023-02-14 02:23:27,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:27,777 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:23:27,780 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-02-14 02:23:27,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 103 [2023-02-14 02:23:28,047 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:23:28,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 86 [2023-02-14 02:23:28,052 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:23:28,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 86 [2023-02-14 02:23:28,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:28,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 88 treesize of output 76 [2023-02-14 02:23:28,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:28,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 60 [2023-02-14 02:23:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:23:28,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:23:28,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:28,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 188 [2023-02-14 02:23:32,123 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse13 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse12 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (and (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse0 v_prenex_2 (store (select .cse0 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse3 v_prenex_2 (store (select .cse3 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((v_prenex_2 Int)) (or (= .cse5 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse6 v_prenex_2 (store (select .cse6 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse8 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse9 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse8 v_prenex_2) (= .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse10 v_prenex_2 (store (select .cse10 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse11 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse14 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse11 .cse12) (< .cse11 .cse13)))) (= (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse16 (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse16 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse18 v_prenex_2 (store (select .cse18 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse19 (select (select (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse19 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse21 v_prenex_2 (store (select .cse21 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse22 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse22 .cse12) (< .cse22 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (<= 0 (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse24 v_prenex_2 (store (select .cse24 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse26 (select (select (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((v_prenex_2 Int)) (or (= .cse26 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse27 v_prenex_2 (store (select .cse27 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (= .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse29 (select (select (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse13)) (= (select (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse33 (select (select (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((v_prenex_2 Int)) (or (= .cse33 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse34 v_prenex_2 (store (select .cse34 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (= .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse36 (select (select (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((v_prenex_2 Int)) (or (= .cse36 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse37 v_prenex_2 (store (select .cse37 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (= .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse40 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse40 v_prenex_2 (store (select .cse40 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse12) (= (select (select (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse13))) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse45 v_prenex_2 (store (select .cse45 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse47 v_prenex_2 (store (select .cse47 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse49 v_prenex_2 (store (select .cse49 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse50 (select (select (let ((.cse51 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse50 .cse12) (< .cse50 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse52 (select (select (let ((.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (forall ((v_prenex_2 Int)) (or (= .cse52 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse53 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse53 v_prenex_2 (store (select .cse53 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (= .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse55 (select (select (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse55 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse57 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse57 v_prenex_2 (store (select .cse57 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse59 (select (select (let ((.cse60 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse58 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse12) (= .cse59 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse61 (select (select (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse61 .cse12) (= (select (select (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< .cse61 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse64 (select (select (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse66 (select (select (let ((.cse68 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse66 .cse12) (= (select (select (let ((.cse67 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse66 .cse13)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse70 (select (select (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (.cse69 (select (select (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse69 .cse12) (= .cse70 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse69 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse74 (select (select (let ((.cse75 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse74 .cse12) (< .cse74 .cse13)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse76 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse77 (select (select (let ((.cse78 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< .cse77 .cse12) (< .cse77 .cse13)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse79 (select (select (let ((.cse81 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse79 .cse12) (= (select (select (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse79 .cse13)))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse82 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse83 v_prenex_2 (store (select .cse83 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse85 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse85 v_prenex_2 (store (select .cse85 v_prenex_2) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse86 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse87 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse12)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from true [2023-02-14 02:23:34,743 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse12 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse13 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse0 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse1 v_prenex_2 (store (select .cse1 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse7 (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse9 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (forall ((v_prenex_2 Int)) (or (= .cse7 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse8 v_prenex_2 (store (select .cse8 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (= .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse11 (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse14 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse11 .cse12) (< .cse11 .cse13)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse15 (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (< .cse15 .cse12) (< .cse15 .cse13)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse18 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse19 v_prenex_2 (store (select .cse19 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse20 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse22 (select (select (let ((.cse23 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse24 (select (select (let ((.cse25 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (< .cse24 .cse12) (< .cse24 .cse13)))) (= (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse27 (select (select (let ((.cse28 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse27 v_prenex_2)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse29 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse29 v_prenex_2 (store (select .cse29 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse31 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse31 v_prenex_2 (store (select .cse31 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse33 v_prenex_2 (store (select .cse33 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse34 v_prenex_2 (store (select .cse34 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse35 (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse37 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse35 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse36 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse36 v_prenex_2 (store (select .cse36 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse38 (select (select (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse38 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse40 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse40 v_prenex_2 (store (select .cse40 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse41 (select (select (let ((.cse42 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse43 (select (select (let ((.cse44 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse43 .cse12) (< .cse43 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse45 (select (select (let ((.cse47 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (forall ((v_prenex_2 Int)) (or (= .cse45 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse46 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse46 v_prenex_2 (store (select .cse46 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (= .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse48 (select (select (let ((.cse50 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse49 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) .cse12) (= .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse52 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) .cse13))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse53 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse54 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse54 v_prenex_2 (store (select .cse54 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse56 (select (select (let ((.cse58 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)) (.cse55 (select (select (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse56 .cse12) (< .cse56 .cse13) (= .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse59 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) .cse12)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse60 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse61 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) .cse12) (= (select (select (let ((.cse62 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse63 (select (select (let ((.cse64 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse63 v_prenex_2) (= .cse63 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse65 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse65 v_prenex_2 (store (select .cse65 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse66 (select (select (let ((.cse67 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (< .cse66 .cse12) (< .cse66 .cse13)))) (= (select (select (let ((.cse68 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse69 (select (select (let ((.cse71 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= .cse69 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse69 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse70 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse70 v_prenex_2 (store (select .cse70 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse72 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse72 v_prenex_2 (store (select .cse72 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse73 (select (select (let ((.cse75 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (< .cse73 .cse12) (< .cse73 .cse13) (= (select (select (let ((.cse74 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse76 (select (select (let ((.cse77 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse76 v_prenex_2) (= .cse76 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse78 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse78 v_prenex_2 (store (select .cse78 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse79 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse80 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse80 v_prenex_2 (store (select .cse80 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse81 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse82 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse82 v_prenex_2 (store (select .cse82 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse83 (select (select (let ((.cse84 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (< .cse83 .cse12) (< .cse83 .cse13)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse85 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse86 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse86 v_prenex_2 (store (select .cse86 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse88 (select (select (let ((.cse89 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse89 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse89 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4))) (or (= (select (select (let ((.cse87 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse88 .cse12) (< .cse88 .cse13)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from true [2023-02-14 02:23:34,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:34,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2023-02-14 02:23:34,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:34,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2023-02-14 02:23:34,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:34,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 328 treesize of output 318 [2023-02-14 02:23:34,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 302 [2023-02-14 02:23:34,998 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:23:35,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:35,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 84 [2023-02-14 02:23:35,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-02-14 02:23:35,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 154 [2023-02-14 02:23:35,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-14 02:23:35,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-14 02:23:35,437 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 1 [2023-02-14 02:23:35,447 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,455 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,465 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,474 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-14 02:23:35,484 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,493 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-14 02:23:35,500 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,509 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2023-02-14 02:23:35,518 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-14 02:23:35,528 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,537 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-14 02:23:35,544 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-14 02:23:35,552 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 1 [2023-02-14 02:23:35,555 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-14 02:23:35,565 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,569 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-14 02:23:35,578 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-14 02:23:35,588 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,598 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,607 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2023-02-14 02:23:35,617 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2023-02-14 02:23:35,627 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,637 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,647 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,657 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,667 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,676 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,686 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:35,696 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-14 02:23:35,706 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2023-02-14 02:23:35,713 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2023-02-14 02:23:35,723 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 02:23:35,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2023-02-14 02:23:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2023-02-14 02:23:36,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035610455] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:23:36,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:23:36,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 41 [2023-02-14 02:23:36,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186721082] [2023-02-14 02:23:36,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:23:36,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-14 02:23:36,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:36,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-14 02:23:36,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1423, Unknown=2, NotChecked=154, Total=1722 [2023-02-14 02:23:36,014 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 42 states, 41 states have (on average 2.658536585365854) internal successors, (109), 42 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:38,661 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select .cse2 .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (or (let ((.cse12 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse13 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse3 (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse6 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse3 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse4 v_prenex_2 (store (select .cse4 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse7 (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse9 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse7 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse8 v_prenex_2 (store (select .cse8 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse11 (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse14 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse11 .cse12) (< .cse11 .cse13)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse15 (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse15 .cse12) (< .cse15 .cse13)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse18 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse19 v_prenex_2 (store (select .cse19 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse20 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse22 (select (select (let ((.cse23 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse24 (select (select (let ((.cse25 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse24 .cse12) (< .cse24 .cse13)))) (= (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse27 (select (select (let ((.cse28 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse27 v_prenex_2)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse29 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse29 v_prenex_2 (store (select .cse29 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse31 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse31 v_prenex_2 (store (select .cse31 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse33 v_prenex_2 (store (select .cse33 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse34 v_prenex_2 (store (select .cse34 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse35 (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse37 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse35 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse36 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse36 v_prenex_2 (store (select .cse36 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse38 (select (select (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse38 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse40 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse40 v_prenex_2 (store (select .cse40 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse41 (select (select (let ((.cse42 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse43 (select (select (let ((.cse44 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse43 .cse12) (< .cse43 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse45 (select (select (let ((.cse47 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse45 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse46 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse46 v_prenex_2 (store (select .cse46 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse48 (select (select (let ((.cse50 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse49 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse12) (= .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse52 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse13))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse53 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse54 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse54 v_prenex_2 (store (select .cse54 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse56 (select (select (let ((.cse58 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (.cse55 (select (select (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse56 .cse12) (< .cse56 .cse13) (= .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse59 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse12)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse60 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse61 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse12) (= (select (select (let ((.cse62 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse63 (select (select (let ((.cse64 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse63 v_prenex_2) (= .cse63 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse65 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse65 v_prenex_2 (store (select .cse65 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse66 (select (select (let ((.cse67 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse66 .cse12) (< .cse66 .cse13)))) (= (select (select (let ((.cse68 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse69 (select (select (let ((.cse71 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse69 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse69 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse70 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse70 v_prenex_2 (store (select .cse70 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse72 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse72 v_prenex_2 (store (select .cse72 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse73 (select (select (let ((.cse75 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse73 .cse12) (< .cse73 .cse13) (= (select (select (let ((.cse74 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse76 (select (select (let ((.cse77 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse76 v_prenex_2) (= .cse76 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse78 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse78 v_prenex_2 (store (select .cse78 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse79 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse80 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse80 v_prenex_2 (store (select .cse80 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse81 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse82 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse82 v_prenex_2 (store (select .cse82 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse83 (select (select (let ((.cse84 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse83 .cse12) (< .cse83 .cse13)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse85 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse86 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse86 v_prenex_2 (store (select .cse86 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse88 (select (select (let ((.cse89 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse89 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse89 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse87 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse88 .cse12) (< .cse88 .cse13)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from true [2023-02-14 02:23:40,707 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (or (let ((.cse13 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse12 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (and (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse1 v_prenex_2 (store (select .cse1 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse3 v_prenex_2 (store (select .cse3 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse5 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse6 v_prenex_2 (store (select .cse6 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse8 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse9 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse8 v_prenex_2) (= .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse10 v_prenex_2 (store (select .cse10 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse11 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse14 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse11 .cse12) (< .cse11 .cse13)))) (= (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse16 (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse16 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse18 v_prenex_2 (store (select .cse18 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse19 (select (select (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse19 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse21 v_prenex_2 (store (select .cse21 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse22 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse22 .cse12) (< .cse22 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (<= 0 (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse24 v_prenex_2 (store (select .cse24 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse26 (select (select (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse26 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse27 v_prenex_2 (store (select .cse27 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse29 (select (select (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse31 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse13)) (= (select (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse33 (select (select (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse33 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse34 v_prenex_2 (store (select .cse34 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse36 (select (select (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse36 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse37 v_prenex_2 (store (select .cse37 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse40 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse40 v_prenex_2 (store (select .cse40 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse12) (= (select (select (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse44 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse13))) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse45 v_prenex_2 (store (select .cse45 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse46 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse47 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse47 v_prenex_2 (store (select .cse47 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse49 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse49 v_prenex_2 (store (select .cse49 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse50 (select (select (let ((.cse51 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse50 .cse12) (< .cse50 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse52 (select (select (let ((.cse54 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse52 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse53 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse53 v_prenex_2 (store (select .cse53 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse55 (select (select (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse55 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse57 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse57 v_prenex_2 (store (select .cse57 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse59 (select (select (let ((.cse60 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse58 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse12) (= .cse59 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse61 (select (select (let ((.cse63 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse61 .cse12) (= (select (select (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< .cse61 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse64 (select (select (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse66 (select (select (let ((.cse68 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse66 .cse12) (= (select (select (let ((.cse67 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse66 .cse13)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse70 (select (select (let ((.cse72 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (.cse69 (select (select (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse69 .cse12) (= .cse70 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse70 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse69 .cse13)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse74 (select (select (let ((.cse75 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse74 .cse12) (< .cse74 .cse13)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse76 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse77 (select (select (let ((.cse78 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse77 .cse12) (< .cse77 .cse13)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse79 (select (select (let ((.cse81 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse79 .cse12) (= (select (select (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse79 .cse13)))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse82 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse83 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse83 v_prenex_2 (store (select .cse83 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse85 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse85 v_prenex_2 (store (select .cse85 v_prenex_2) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse86 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse87 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse12)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2023-02-14 02:23:43,391 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select .cse6 .cse1)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (or (let ((.cse13 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse14 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse3 (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse3 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse4 v_prenex_2 (store (select .cse4 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse8 (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse8 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse9 v_prenex_2 (store (select .cse9 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse12 (select (select (let ((.cse15 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse12 .cse13) (< .cse12 .cse14)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse16 (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse16 .cse13) (< .cse16 .cse14)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse18 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse19 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse20 v_prenex_2 (store (select .cse20 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse22 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse23 (select (select (let ((.cse24 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse24 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse25 (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse25 .cse13) (< .cse25 .cse14)))) (= (select (select (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse28 (select (select (let ((.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse28 v_prenex_2)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse30 v_prenex_2 (store (select .cse30 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse31 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse32 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse32 v_prenex_2 (store (select .cse32 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse34 v_prenex_2 (store (select .cse34 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse35 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse35 v_prenex_2 (store (select .cse35 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse36 (select (select (let ((.cse38 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse36 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse37 v_prenex_2 (store (select .cse37 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse39 (select (select (let ((.cse40 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse39 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse41 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse41 v_prenex_2 (store (select .cse41 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse42 (select (select (let ((.cse43 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse44 (select (select (let ((.cse45 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse44 .cse13) (< .cse44 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse46 (select (select (let ((.cse48 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse46 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse47 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse47 v_prenex_2 (store (select .cse47 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse49 (select (select (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse50 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse50 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse13) (= .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse52 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse53 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse14))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse54 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse55 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse55 v_prenex_2 (store (select .cse55 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse57 (select (select (let ((.cse59 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (.cse56 (select (select (let ((.cse58 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse57 .cse13) (< .cse57 .cse14) (= .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse60 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse13)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse61 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse62 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse13) (= (select (select (let ((.cse63 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse64 (select (select (let ((.cse65 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse64 v_prenex_2) (= .cse64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse66 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse66 v_prenex_2 (store (select .cse66 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse67 (select (select (let ((.cse68 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse67 .cse13) (< .cse67 .cse14)))) (= (select (select (let ((.cse69 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse70 (select (select (let ((.cse72 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse70 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse70 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse71 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse71 v_prenex_2 (store (select .cse71 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse73 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse73 v_prenex_2 (store (select .cse73 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse74 (select (select (let ((.cse76 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse74 .cse13) (< .cse74 .cse14) (= (select (select (let ((.cse75 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse77 (select (select (let ((.cse78 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse77 v_prenex_2) (= .cse77 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse79 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse79 v_prenex_2 (store (select .cse79 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse80 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse80 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse81 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse81 v_prenex_2 (store (select .cse81 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse82 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse83 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse83 v_prenex_2 (store (select .cse83 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse84 (select (select (let ((.cse85 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse84 .cse13) (< .cse84 .cse14)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse86 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse87 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse87 v_prenex_2 (store (select .cse87 v_prenex_2) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse89 (select (select (let ((.cse90 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse90 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse90 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse88 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse89 .cse13) (< .cse89 .cse14)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from true [2023-02-14 02:23:45,428 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (or (let ((.cse14 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse13 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (and (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse2 v_prenex_2 (store (select .cse2 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse4 v_prenex_2 (store (select .cse4 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse8 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse6 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse7 v_prenex_2 (store (select .cse7 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse9 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse9 v_prenex_2) (= .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse11 v_prenex_2 (store (select .cse11 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse12 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse12 .cse13) (< .cse12 .cse14)))) (= (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse17 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse17 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse19 v_prenex_2 (store (select .cse19 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse20 (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse20 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse20 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse22 v_prenex_2 (store (select .cse22 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse23 (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse24 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse23 .cse13) (< .cse23 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (<= 0 (select (select (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse25 v_prenex_2 (store (select .cse25 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (= (select (select (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse27 (select (select (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse27 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse28 v_prenex_2 (store (select .cse28 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse30 (select (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse14)) (= (select (select (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse34 (select (select (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse34 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse35 v_prenex_2 (store (select .cse35 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse37 (select (select (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse37 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse38 v_prenex_2 (store (select .cse38 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse37 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse41 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse41 v_prenex_2 (store (select .cse41 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse42 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse13) (= (select (select (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse14))) (forall ((v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse46 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse46 v_prenex_2 (store (select .cse46 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse47 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse48 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse48 v_prenex_2 (store (select .cse48 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse50 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse50 v_prenex_2 (store (select .cse50 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse51 (select (select (let ((.cse52 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse51 .cse13) (< .cse51 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse53 (select (select (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_prenex_2 Int)) (or (= .cse53 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse54 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse54 v_prenex_2 (store (select .cse54 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (= .cse53 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse56 (select (select (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse56 v_prenex_2) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse58 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse58 v_prenex_2 (store (select .cse58 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse60 (select (select (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse61 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse13) (= .cse60 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse62 (select (select (let ((.cse64 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse62 .cse13) (= (select (select (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse63 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< .cse62 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse65 (select (select (let ((.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse65 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse67 (select (select (let ((.cse69 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse67 .cse13) (= (select (select (let ((.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse67 .cse14)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse71 (select (select (let ((.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse73 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) (.cse70 (select (select (let ((.cse72 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse72 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse70 .cse13) (= .cse71 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse70 .cse14)))) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse75 (select (select (let ((.cse76 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse76 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse75 .cse13) (< .cse75 .cse14)))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse77 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse77 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse78 (select (select (let ((.cse79 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse79 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< .cse78 .cse13) (< .cse78 .cse14)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse80 (select (select (let ((.cse82 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse80 .cse13) (= (select (select (let ((.cse81 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse80 .cse14)))) (forall ((v_prenex_2 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse83 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse83 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse84 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse84 v_prenex_2 (store (select .cse84 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse85 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse85 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse86 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse86 v_prenex_2 (store (select .cse86 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse87 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse87 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse88 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) .cse13)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from true [2023-02-14 02:23:48,072 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse99 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse98 (select .cse8 .cse99)) (.cse97 (select .cse2 .cse99)) (.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse5 (select .cse12 .cse1)) (.cse4 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse6 (<= 0 .cse97)) (.cse7 (not (= .cse98 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse9 (<= (+ .cse97 12) (select |c_#length| .cse98))) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select .cse2 .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse4 12) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse6 (= (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse7 (or (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse8 4)) (exists ((v_arrayElimCell_44 Int)) (and (<= 12 (select |c_#length| v_arrayElimCell_44)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimCell_44)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (select .cse2 4)) (<= 8 .cse4)) (and .cse6 .cse7 .cse9 (exists ((|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)) (<= 8 (select |c_#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse9 (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 12 (select |c_#length| (select .cse8 .cse3))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (or (let ((.cse19 (+ 5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse20 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse10 (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse13 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse10 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse11 v_prenex_2 (store (select .cse11 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (let ((.cse14 (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse14 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse15 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse15 v_prenex_2 (store (select .cse15 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse18 (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse21 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse17 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse18 .cse19) (< .cse18 .cse20)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse22 (select (select (let ((.cse23 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse22 .cse19) (< .cse22 .cse20)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse24 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse24 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse25 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse26 v_prenex_2 (store (select .cse26 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse28 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse20)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse29 (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse29 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse31 (select (select (let ((.cse32 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse31 .cse19) (< .cse31 .cse20)))) (= (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse34 (select (select (let ((.cse35 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse34 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse34 v_prenex_2)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse36 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse36 v_prenex_2 (store (select .cse36 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse37 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse38 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse38 v_prenex_2 (store (select .cse38 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse40 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse40 v_prenex_2 (store (select .cse40 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse41 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse41 v_prenex_2 (store (select .cse41 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse42 (select (select (let ((.cse44 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse42 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse42 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse43 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse43 v_prenex_2 (store (select .cse43 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse45 (select (select (let ((.cse46 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse45 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse45 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse47 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse47 v_prenex_2 (store (select .cse47 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse48 (select (select (let ((.cse49 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse49 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse48 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse50 (select (select (let ((.cse51 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse51 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse50 .cse19) (< .cse50 .cse20)))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse52 (select (select (let ((.cse54 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse54 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (forall ((v_prenex_2 Int)) (or (= .cse52 v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse53 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse53 v_prenex_2 (store (select .cse53 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (= .cse52 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse55 (select (select (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse57 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse55 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse56 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse56 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse19) (= .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse58 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse58 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse59 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse59 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse20))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse60 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse60 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse61 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse61 v_prenex_2 (store (select .cse61 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse63 (select (select (let ((.cse65 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse65 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (.cse62 (select (select (let ((.cse64 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse64 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse62 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse63 .cse19) (< .cse63 .cse20) (= .cse62 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (< (select (select (let ((.cse66 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse66 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse19)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_1645 (Array Int Int))) (= (select (select (let ((.cse67 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse67 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< (select (select (let ((.cse68 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse68 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse19) (= (select (select (let ((.cse69 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse69 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse70 (select (select (let ((.cse71 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse71 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse70 v_prenex_2) (= .cse70 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse72 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse72 v_prenex_2 (store (select .cse72 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1646 (Array Int Int))) (let ((.cse73 (select (select (let ((.cse74 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse74 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse73 .cse19) (< .cse73 .cse20)))) (= (select (select (let ((.cse75 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse75 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse76 (select (select (let ((.cse78 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse78 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse76 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2 Int)) (or (= .cse76 v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse77 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse77 v_prenex_2 (store (select .cse77 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) (forall ((v_prenex_2 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse79 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse79 v_prenex_2 (store (select .cse79 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse80 (select (select (let ((.cse82 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse82 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse80 .cse19) (< .cse80 .cse20) (= (select (select (let ((.cse81 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse81 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse83 (select (select (let ((.cse84 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse84 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse83 v_prenex_2) (= .cse83 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse85 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse85 v_prenex_2 (store (select .cse85 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (let ((.cse86 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse86 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse87 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse87 v_prenex_2 (store (select .cse87 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1645 (Array Int Int)) (v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (v_prenex_1 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (let ((.cse88 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse88 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= 0 (select (select (let ((.cse89 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse89 v_prenex_2 (store (select .cse89 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse90 (select (select (let ((.cse91 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse91 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse91 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse90 .cse19) (< .cse90 .cse20)))) (forall ((v_prenex_2 Int) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int)) (or (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (= (select (select (let ((.cse92 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse92 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse92 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_2)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) (forall ((v_prenex_1 (Array Int Int))) (<= 0 (select (select (let ((.cse93 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1))) (store .cse93 v_prenex_2 (store (select .cse93 v_prenex_2) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1645 (Array Int Int)) (v_ArrVal_1642 Int) (v_ArrVal_1641 Int) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse95 (select (select (let ((.cse96 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1641)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1646))) (store .cse96 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse96 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= (select (select (let ((.cse94 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1642)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1645))) (store .cse94 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse94 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< .cse95 .cse19) (< .cse95 .cse20)))))) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from true [2023-02-14 02:23:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:52,938 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2023-02-14 02:23:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 02:23:52,939 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.658536585365854) internal successors, (109), 42 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-02-14 02:23:52,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:52,939 INFO L225 Difference]: With dead ends: 109 [2023-02-14 02:23:52,940 INFO L226 Difference]: Without dead ends: 109 [2023-02-14 02:23:52,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=578, Invalid=2983, Unknown=7, NotChecked=854, Total=4422 [2023-02-14 02:23:52,941 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 463 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-14 02:23:52,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 336 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 837 Invalid, 0 Unknown, 213 Unchecked, 1.5s Time] [2023-02-14 02:23:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-14 02:23:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 78. [2023-02-14 02:23:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2023-02-14 02:23:52,943 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 43 [2023-02-14 02:23:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:52,943 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2023-02-14 02:23:52,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.658536585365854) internal successors, (109), 42 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:23:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2023-02-14 02:23:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 02:23:52,943 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:52,943 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:23:52,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 02:23:53,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-14 02:23:53,150 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-02-14 02:23:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1163623530, now seen corresponding path program 1 times [2023-02-14 02:23:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:53,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595110007] [2023-02-14 02:23:53,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:53,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:23:56,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:56,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595110007] [2023-02-14 02:23:56,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595110007] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:23:56,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432586663] [2023-02-14 02:23:56,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:56,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:23:56,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:23:56,476 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:23:56,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 02:23:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:56,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 111 conjunts are in the unsatisfiable core [2023-02-14 02:23:56,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:23:56,956 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 02:23:56,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 02:23:57,276 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-14 02:23:57,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-14 02:23:57,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:23:57,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:23:58,006 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-14 02:23:58,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-02-14 02:23:58,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 02:23:58,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:23:58,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-14 02:23:58,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:58,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 02:23:58,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:58,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 02:23:58,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:23:58,423 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:23:58,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 74 [2023-02-14 02:23:58,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2023-02-14 02:23:58,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-14 02:23:58,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2023-02-14 02:23:58,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 02:23:58,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 02:23:58,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:58,940 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:23:58,943 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:23:58,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2023-02-14 02:23:58,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:58,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-14 02:23:58,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 02:23:59,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:59,420 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:23:59,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 50 [2023-02-14 02:23:59,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:59,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:59,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-14 02:23:59,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 02:23:59,594 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:23:59,619 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-02-14 02:23:59,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 39 [2023-02-14 02:23:59,626 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:23:59,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2023-02-14 02:23:59,963 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-14 02:24:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:24:00,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:24:02,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:24:02,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 143 [2023-02-14 02:24:02,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:24:02,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1365 treesize of output 1351 [2023-02-14 02:24:02,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1583 treesize of output 1527 [2023-02-14 02:24:02,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:24:02,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1316 treesize of output 918 [2023-02-14 02:24:02,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:24:02,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5424 treesize of output 5302 [2023-02-14 02:24:02,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6242 treesize of output 5986 [2023-02-14 02:24:02,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2209 treesize of output 2121 [2023-02-14 02:25:15,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4422 treesize of output 4314