./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-1.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 --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 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:49:18,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:49:18,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:49:18,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:49:18,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:49:18,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:49:18,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:49:18,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:49:18,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:49:18,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:49:18,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:49:18,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:49:18,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:49:18,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:49:18,744 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:49:18,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:49:18,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:49:18,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:49:18,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:49:18,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:49:18,747 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:49:18,749 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:49:18,750 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:49:18,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:49:18,750 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:49:18,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:49:18,751 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:49:18,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:49:18,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:49:18,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:49:18,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:49:18,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:49:18,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:49:18,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:49:18,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:49:18,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:49:18,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:49:18,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:49:18,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:49:18,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:49:18,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:49:18,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:49:18,757 INFO L153 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 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 -> 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa [2024-11-17 00:49:18,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:49:19,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:49:19,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:49:19,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:49:19,012 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:49:19,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2024-11-17 00:49:20,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:49:20,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:49:20,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2024-11-17 00:49:20,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6584a6ec4/d5368636c6ea48168b44bbdfa6bf5db9/FLAG1a7c9c210 [2024-11-17 00:49:20,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6584a6ec4/d5368636c6ea48168b44bbdfa6bf5db9 [2024-11-17 00:49:20,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:49:20,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:49:20,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:49:20,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:49:20,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:49:20,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:49:20" (1/1) ... [2024-11-17 00:49:20,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50de5bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:20, skipping insertion in model container [2024-11-17 00:49:20,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:49:20" (1/1) ... [2024-11-17 00:49:20,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:49:21,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:49:21,234 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:49:21,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:49:21,367 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:49:21,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21 WrapperNode [2024-11-17 00:49:21,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:49:21,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:49:21,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:49:21,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:49:21,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,441 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2024-11-17 00:49:21,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:49:21,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:49:21,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:49:21,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:49:21,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,480 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-11-17 00:49:21,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:49:21,494 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:49:21,494 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:49:21,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:49:21,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (1/1) ... [2024-11-17 00:49:21,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:49:21,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:21,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:49:21,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:49:21,578 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-17 00:49:21,578 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-17 00:49:21,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:49:21,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:49:21,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:49:21,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:49:21,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:49:21,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:49:21,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:49:21,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:49:21,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:49:21,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:49:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:49:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:49:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:49:21,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:49:21,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:49:21,680 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:49:21,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:49:21,707 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-17 00:49:21,974 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2024-11-17 00:49:21,975 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2024-11-17 00:49:21,975 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2024-11-17 00:49:21,975 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2024-11-17 00:49:21,975 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2024-11-17 00:49:21,976 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint reach_error_returnLabel#1: assume true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2024-11-17 00:49:21,991 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-17 00:49:21,991 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:49:22,010 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:49:22,011 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:49:22,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:49:22 BoogieIcfgContainer [2024-11-17 00:49:22,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:49:22,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:49:22,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:49:22,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:49:22,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:49:20" (1/3) ... [2024-11-17 00:49:22,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b32c51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:49:22, skipping insertion in model container [2024-11-17 00:49:22,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:49:21" (2/3) ... [2024-11-17 00:49:22,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b32c51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:49:22, skipping insertion in model container [2024-11-17 00:49:22,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:49:22" (3/3) ... [2024-11-17 00:49:22,024 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-1.i [2024-11-17 00:49:22,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:49:22,046 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2024-11-17 00:49:22,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:49:22,107 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@364d6ebe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:49:22,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-11-17 00:49:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 45 states have (on average 1.9333333333333333) 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) [2024-11-17 00:49:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 00:49:22,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:22,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 00:49:22,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:22,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:22,125 INFO L85 PathProgramCache]: Analyzing trace with hash 4062460, now seen corresponding path program 1 times [2024-11-17 00:49:22,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:22,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592256284] [2024-11-17 00:49:22,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:22,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:22,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:22,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592256284] [2024-11-17 00:49:22,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592256284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:22,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:22,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:49:22,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306499561] [2024-11-17 00:49:22,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:22,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:49:22,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:22,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:49:22,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:49:22,392 INFO L87 Difference]: Start difference. First operand has 80 states, 45 states have (on average 1.9333333333333333) 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) [2024-11-17 00:49:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:22,503 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-11-17 00:49:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:49:22,505 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 [2024-11-17 00:49:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:22,509 INFO L225 Difference]: With dead ends: 76 [2024-11-17 00:49:22,509 INFO L226 Difference]: Without dead ends: 69 [2024-11-17 00:49:22,511 INFO L431 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 [2024-11-17 00:49:22,514 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 22 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 92 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 [2024-11-17 00:49:22,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-17 00:49:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-17 00:49:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 68 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) [2024-11-17 00:49:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-17 00:49:22,542 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 4 [2024-11-17 00:49:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:22,542 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-17 00:49:22,542 INFO L472 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) [2024-11-17 00:49:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-17 00:49:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 00:49:22,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:22,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 00:49:22,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:49:22,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:22,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash 4062461, now seen corresponding path program 1 times [2024-11-17 00:49:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:22,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108147648] [2024-11-17 00:49:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:22,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:22,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:22,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108147648] [2024-11-17 00:49:22,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108147648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:22,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:22,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:49:22,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640569804] [2024-11-17 00:49:22,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:22,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:49:22,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:22,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:49:22,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:49:22,661 INFO L87 Difference]: Start difference. First operand 69 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) [2024-11-17 00:49:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:22,723 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-11-17 00:49:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:49:22,724 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 [2024-11-17 00:49:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:22,725 INFO L225 Difference]: With dead ends: 65 [2024-11-17 00:49:22,725 INFO L226 Difference]: Without dead ends: 65 [2024-11-17 00:49:22,725 INFO L431 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 [2024-11-17 00:49:22,726 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 20 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 85 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 [2024-11-17 00:49:22,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 85 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-17 00:49:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-17 00:49:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 64 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) [2024-11-17 00:49:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-11-17 00:49:22,735 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 4 [2024-11-17 00:49:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:22,735 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-11-17 00:49:22,735 INFO L472 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) [2024-11-17 00:49:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-11-17 00:49:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:49:22,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:22,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:22,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:49:22,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:22,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash -760051365, now seen corresponding path program 1 times [2024-11-17 00:49:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:22,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541715531] [2024-11-17 00:49:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:22,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541715531] [2024-11-17 00:49:22,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541715531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:22,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:22,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:49:22,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339784515] [2024-11-17 00:49:22,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:22,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:49:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:22,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:49:22,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:49:22,898 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-17 00:49:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:22,917 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-11-17 00:49:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:49:22,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-17 00:49:22,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:22,922 INFO L225 Difference]: With dead ends: 78 [2024-11-17 00:49:22,922 INFO L226 Difference]: Without dead ends: 78 [2024-11-17 00:49:22,923 INFO L431 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 [2024-11-17 00:49:22,924 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 11 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:22,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 126 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:49:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-17 00:49:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2024-11-17 00:49:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.6511627906976745) 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) [2024-11-17 00:49:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-11-17 00:49:22,935 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 11 [2024-11-17 00:49:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:22,935 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-11-17 00:49:22,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-17 00:49:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-11-17 00:49:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:49:22,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:22,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:22,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:49:22,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:22,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:22,937 INFO L85 PathProgramCache]: Analyzing trace with hash -760048965, now seen corresponding path program 1 times [2024-11-17 00:49:22,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:22,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320152155] [2024-11-17 00:49:22,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:22,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:23,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:23,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320152155] [2024-11-17 00:49:23,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320152155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:23,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:49:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400127655] [2024-11-17 00:49:23,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:23,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:49:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:23,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:49:23,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:49:23,032 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-17 00:49:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:23,102 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-11-17 00:49:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:49:23,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-17 00:49:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:23,104 INFO L225 Difference]: With dead ends: 65 [2024-11-17 00:49:23,104 INFO L226 Difference]: Without dead ends: 65 [2024-11-17 00:49:23,104 INFO L431 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 [2024-11-17 00:49:23,105 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 5 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:23,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-17 00:49:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-17 00:49:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 64 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) [2024-11-17 00:49:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-11-17 00:49:23,115 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2024-11-17 00:49:23,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:23,115 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-11-17 00:49:23,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-17 00:49:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-11-17 00:49:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:49:23,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:23,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:23,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:49:23,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:23,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:23,120 INFO L85 PathProgramCache]: Analyzing trace with hash -760048964, now seen corresponding path program 1 times [2024-11-17 00:49:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:23,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579744218] [2024-11-17 00:49:23,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:23,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:23,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:23,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579744218] [2024-11-17 00:49:23,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579744218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:23,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:23,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:49:23,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517893593] [2024-11-17 00:49:23,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:23,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:49:23,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:23,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:49:23,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:49:23,227 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-17 00:49:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:23,274 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2024-11-17 00:49:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:49:23,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-17 00:49:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:23,275 INFO L225 Difference]: With dead ends: 63 [2024-11-17 00:49:23,276 INFO L226 Difference]: Without dead ends: 63 [2024-11-17 00:49:23,276 INFO L431 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 [2024-11-17 00:49:23,277 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:23,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:49:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-17 00:49:23,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-17 00:49:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.558139534883721) internal successors, (67), 62 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) [2024-11-17 00:49:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-11-17 00:49:23,288 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2024-11-17 00:49:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:23,289 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-11-17 00:49:23,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-17 00:49:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-11-17 00:49:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:49:23,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:23,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:23,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:49:23,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:23,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash -262613672, now seen corresponding path program 1 times [2024-11-17 00:49:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326074291] [2024-11-17 00:49:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:23,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326074291] [2024-11-17 00:49:23,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326074291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:23,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:23,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:49:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820328316] [2024-11-17 00:49:23,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:23,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:49:23,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:49:23,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:49:23,457 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-17 00:49:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:23,551 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-17 00:49:23,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:49:23,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2024-11-17 00:49:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:23,552 INFO L225 Difference]: With dead ends: 67 [2024-11-17 00:49:23,553 INFO L226 Difference]: Without dead ends: 67 [2024-11-17 00:49:23,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:49:23,554 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:23,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 104 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-17 00:49:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-17 00:49:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 66 states have internal predecessors, (72), 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) [2024-11-17 00:49:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-17 00:49:23,562 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 13 [2024-11-17 00:49:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:23,562 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-17 00:49:23,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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) [2024-11-17 00:49:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-17 00:49:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:49:23,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:23,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:23,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:49:23,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:23,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash -262613671, now seen corresponding path program 1 times [2024-11-17 00:49:23,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:23,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885424375] [2024-11-17 00:49:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:23,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:23,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885424375] [2024-11-17 00:49:23,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885424375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:23,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:23,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:49:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433105363] [2024-11-17 00:49:23,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:23,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:49:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:49:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:49:23,741 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2024-11-17 00:49:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:23,818 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-11-17 00:49:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:49:23,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-17 00:49:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:23,820 INFO L225 Difference]: With dead ends: 67 [2024-11-17 00:49:23,820 INFO L226 Difference]: Without dead ends: 67 [2024-11-17 00:49:23,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:49:23,821 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:23,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 116 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-17 00:49:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-17 00:49:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.5106382978723405) 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) [2024-11-17 00:49:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-11-17 00:49:23,829 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 13 [2024-11-17 00:49:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:23,829 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-11-17 00:49:23,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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) [2024-11-17 00:49:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-11-17 00:49:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:49:23,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:23,830 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:23,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:49:23,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:23,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:23,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1756457335, now seen corresponding path program 1 times [2024-11-17 00:49:23,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:23,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577058868] [2024-11-17 00:49:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:23,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:23,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:23,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577058868] [2024-11-17 00:49:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577058868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:23,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:23,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:49:23,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433883899] [2024-11-17 00:49:23,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:23,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:49:23,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:23,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:49:23,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:49:23,929 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2024-11-17 00:49:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:24,013 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-11-17 00:49:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:49:24,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 [2024-11-17 00:49:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:24,014 INFO L225 Difference]: With dead ends: 65 [2024-11-17 00:49:24,015 INFO L226 Difference]: Without dead ends: 65 [2024-11-17 00:49:24,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:49:24,016 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:24,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-17 00:49:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-17 00:49:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 64 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) [2024-11-17 00:49:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-11-17 00:49:24,026 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 18 [2024-11-17 00:49:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:24,026 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-11-17 00:49:24,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2024-11-17 00:49:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-11-17 00:49:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:49:24,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:24,028 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:24,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:49:24,028 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:24,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:24,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1756457334, now seen corresponding path program 1 times [2024-11-17 00:49:24,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:24,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242996568] [2024-11-17 00:49:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:24,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242996568] [2024-11-17 00:49:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242996568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:24,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931536617] [2024-11-17 00:49:24,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:24,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:24,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:24,137 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) [2024-11-17 00:49:24,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:49:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:24,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:49:24,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:24,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:24,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931536617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:24,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:24,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-17 00:49:24,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534150465] [2024-11-17 00:49:24,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:24,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:49:24,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:24,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:49:24,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:49:24,393 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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) [2024-11-17 00:49:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:24,414 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-17 00:49:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:49:24,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 [2024-11-17 00:49:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:24,417 INFO L225 Difference]: With dead ends: 84 [2024-11-17 00:49:24,417 INFO L226 Difference]: Without dead ends: 84 [2024-11-17 00:49:24,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:49:24,418 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:24,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 174 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:49:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-17 00:49:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-17 00:49:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.375) internal successors, (88), 81 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) [2024-11-17 00:49:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-11-17 00:49:24,424 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 18 [2024-11-17 00:49:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:24,424 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-11-17 00:49:24,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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) [2024-11-17 00:49:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-11-17 00:49:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:49:24,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:24,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:24,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:49:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:24,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:24,628 INFO L85 PathProgramCache]: Analyzing trace with hash -31043833, now seen corresponding path program 1 times [2024-11-17 00:49:24,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:24,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118706106] [2024-11-17 00:49:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:24,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:24,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118706106] [2024-11-17 00:49:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118706106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172993806] [2024-11-17 00:49:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:24,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:24,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:24,854 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) [2024-11-17 00:49:24,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:49:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:24,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:49:24,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:25,017 INFO L378 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 [2024-11-17 00:49:25,072 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:49:25,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:49:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:25,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:25,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172993806] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:25,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:25,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-11-17 00:49:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136539402] [2024-11-17 00:49:25,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:25,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:49:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:25,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:49:25,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:49:25,230 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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) [2024-11-17 00:49:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:25,348 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-17 00:49:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:49:25,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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 20 [2024-11-17 00:49:25,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:25,349 INFO L225 Difference]: With dead ends: 80 [2024-11-17 00:49:25,349 INFO L226 Difference]: Without dead ends: 80 [2024-11-17 00:49:25,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:49:25,350 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:25,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 188 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-17 00:49:25,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-17 00:49:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.3125) internal successors, (84), 79 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) [2024-11-17 00:49:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-17 00:49:25,354 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 20 [2024-11-17 00:49:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:25,354 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-17 00:49:25,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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) [2024-11-17 00:49:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-17 00:49:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:49:25,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:25,355 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:25,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 00:49:25,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-17 00:49:25,560 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:25,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash 624727126, now seen corresponding path program 1 times [2024-11-17 00:49:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:25,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86282377] [2024-11-17 00:49:25,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-17 00:49:25,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:25,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86282377] [2024-11-17 00:49:25,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86282377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:25,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:25,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:49:25,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985522655] [2024-11-17 00:49:25,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:25,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:49:25,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:25,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:49:25,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:49:25,718 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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) [2024-11-17 00:49:25,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:25,844 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-11-17 00:49:25,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:49:25,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 [2024-11-17 00:49:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:25,846 INFO L225 Difference]: With dead ends: 81 [2024-11-17 00:49:25,846 INFO L226 Difference]: Without dead ends: 81 [2024-11-17 00:49:25,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:49:25,847 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:25,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 117 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-17 00:49:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2024-11-17 00:49:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.2575757575757576) 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) [2024-11-17 00:49:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-11-17 00:49:25,850 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 43 [2024-11-17 00:49:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:25,851 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-11-17 00:49:25,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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) [2024-11-17 00:49:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-11-17 00:49:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 00:49:25,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:25,852 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:25,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:49:25,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:25,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash 624727127, now seen corresponding path program 1 times [2024-11-17 00:49:25,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:25,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249735441] [2024-11-17 00:49:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-17 00:49:26,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:26,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249735441] [2024-11-17 00:49:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249735441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:26,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:26,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:49:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670253774] [2024-11-17 00:49:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:26,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:49:26,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:26,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:49:26,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:49:26,117 INFO L87 Difference]: Start difference. First operand 78 states and 83 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) [2024-11-17 00:49:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:26,251 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-11-17 00:49:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:49:26,251 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 43 [2024-11-17 00:49:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:26,252 INFO L225 Difference]: With dead ends: 85 [2024-11-17 00:49:26,252 INFO L226 Difference]: Without dead ends: 85 [2024-11-17 00:49:26,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:49:26,253 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:26,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 182 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-17 00:49:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-17 00:49:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 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) [2024-11-17 00:49:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-11-17 00:49:26,256 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 43 [2024-11-17 00:49:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:26,256 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-11-17 00:49:26,256 INFO L472 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) [2024-11-17 00:49:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-17 00:49:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-17 00:49:26,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:26,257 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:26,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:49:26,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:26,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:26,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1368955944, now seen corresponding path program 1 times [2024-11-17 00:49:26,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:26,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554915787] [2024-11-17 00:49:26,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:26,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 00:49:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554915787] [2024-11-17 00:49:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554915787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604365502] [2024-11-17 00:49:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:27,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:27,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:27,034 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) [2024-11-17 00:49:27,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:49:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:27,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-17 00:49:27,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:27,381 INFO L378 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 [2024-11-17 00:49:27,509 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:49:27,510 INFO L378 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 [2024-11-17 00:49:27,578 INFO L378 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 [2024-11-17 00:49:27,622 INFO L378 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 16 treesize of output 11 [2024-11-17 00:49:27,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:49:27,718 INFO L378 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 27 treesize of output 11 [2024-11-17 00:49:27,759 INFO L378 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 27 treesize of output 11 [2024-11-17 00:49:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:49:27,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:27,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_843 (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_843 .cse0))))))) is different from false [2024-11-17 00:49:28,001 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_842))) (or (= (select (select (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |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|) (not (= v_ArrVal_843 (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_843 .cse1)))))))) is different from false [2024-11-17 00:49:28,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:28,014 INFO L378 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 48 treesize of output 40 [2024-11-17 00:49:28,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:28,032 INFO L378 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 160 treesize of output 160 [2024-11-17 00:49:28,061 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-17 00:49:28,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 76 [2024-11-17 00:49:28,125 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:28,186 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-17 00:49:28,187 INFO L378 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 51 treesize of output 45 [2024-11-17 00:49:28,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:28,214 INFO L378 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 55 treesize of output 59 [2024-11-17 00:49:28,286 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-17 00:49:28,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 58 [2024-11-17 00:49:28,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:28,318 INFO L378 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 26 treesize of output 30 [2024-11-17 00:49:28,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:28,333 INFO L378 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 26 treesize of output 30 [2024-11-17 00:49:28,344 INFO L378 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 62 treesize of output 56 [2024-11-17 00:49:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 11 trivial. 6 not checked. [2024-11-17 00:49:28,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604365502] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:28,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:28,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2024-11-17 00:49:28,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519461069] [2024-11-17 00:49:28,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:28,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-17 00:49:28,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-17 00:49:28,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=712, Unknown=20, NotChecked=110, Total=930 [2024-11-17 00:49:28,700 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 31 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 31 states have internal predecessors, (101), 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) [2024-11-17 00:49:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:29,320 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-11-17 00:49:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:49:29,321 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 31 states have internal predecessors, (101), 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 47 [2024-11-17 00:49:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:29,322 INFO L225 Difference]: With dead ends: 81 [2024-11-17 00:49:29,322 INFO L226 Difference]: Without dead ends: 81 [2024-11-17 00:49:29,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=1230, Unknown=21, NotChecked=150, Total=1640 [2024-11-17 00:49:29,323 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:29,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 707 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 506 Invalid, 0 Unknown, 76 Unchecked, 0.3s Time] [2024-11-17 00:49:29,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-17 00:49:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-17 00:49:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 80 states have internal predecessors, (85), 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) [2024-11-17 00:49:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-17 00:49:29,326 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 47 [2024-11-17 00:49:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:29,326 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-17 00:49:29,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 31 states have internal predecessors, (101), 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) [2024-11-17 00:49:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-17 00:49:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-17 00:49:29,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:29,327 INFO L215 NwaCegarLoop]: trace histogram [5, 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, 1] [2024-11-17 00:49:29,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:49:29,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:29,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:29,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1373440301, now seen corresponding path program 1 times [2024-11-17 00:49:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:29,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435877809] [2024-11-17 00:49:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:29,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-17 00:49:29,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:29,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435877809] [2024-11-17 00:49:29,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435877809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:29,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:29,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:49:29,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763119459] [2024-11-17 00:49:29,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:29,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:49:29,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:29,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:49:29,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:49:29,696 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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) [2024-11-17 00:49:29,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:29,841 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2024-11-17 00:49:29,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:49:29,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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 49 [2024-11-17 00:49:29,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:29,842 INFO L225 Difference]: With dead ends: 87 [2024-11-17 00:49:29,842 INFO L226 Difference]: Without dead ends: 87 [2024-11-17 00:49:29,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:49:29,843 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:29,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 121 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:29,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-17 00:49:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-11-17 00:49:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 79 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) [2024-11-17 00:49:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-17 00:49:29,845 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 49 [2024-11-17 00:49:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:29,847 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-17 00:49:29,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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) [2024-11-17 00:49:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-17 00:49:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-17 00:49:29,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:29,849 INFO L215 NwaCegarLoop]: trace histogram [5, 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, 1] [2024-11-17 00:49:29,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 00:49:29,849 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:29,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:29,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1373440302, now seen corresponding path program 1 times [2024-11-17 00:49:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:29,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839845236] [2024-11-17 00:49:29,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-17 00:49:30,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:30,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839845236] [2024-11-17 00:49:30,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839845236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:49:30,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:49:30,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:49:30,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138830773] [2024-11-17 00:49:30,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:49:30,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:49:30,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:49:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:49:30,165 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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) [2024-11-17 00:49:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:30,312 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-17 00:49:30,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:49:30,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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 49 [2024-11-17 00:49:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:30,313 INFO L225 Difference]: With dead ends: 83 [2024-11-17 00:49:30,313 INFO L226 Difference]: Without dead ends: 83 [2024-11-17 00:49:30,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:49:30,314 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:30,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 206 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:49:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-17 00:49:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-11-17 00:49:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 78 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) [2024-11-17 00:49:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-17 00:49:30,316 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 49 [2024-11-17 00:49:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:30,316 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-17 00:49:30,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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) [2024-11-17 00:49:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-17 00:49:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:49:30,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:30,317 INFO L215 NwaCegarLoop]: trace histogram [5, 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] [2024-11-17 00:49:30,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:49:30,317 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:30,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:30,318 INFO L85 PathProgramCache]: Analyzing trace with hash -373022085, now seen corresponding path program 1 times [2024-11-17 00:49:30,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109844464] [2024-11-17 00:49:30,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:30,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:49:31,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:31,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109844464] [2024-11-17 00:49:31,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109844464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:31,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909596496] [2024-11-17 00:49:31,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:31,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:31,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:31,374 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) [2024-11-17 00:49:31,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:49:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:31,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-17 00:49:31,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:31,604 INFO L378 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 [2024-11-17 00:49:31,693 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:49:31,694 INFO L378 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 [2024-11-17 00:49:31,734 INFO L378 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 15 treesize of output 1 [2024-11-17 00:49:31,736 INFO L378 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 [2024-11-17 00:49:31,783 INFO L378 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 23 treesize of output 11 [2024-11-17 00:49:31,789 INFO L378 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 23 treesize of output 11 [2024-11-17 00:49:31,816 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:49:31,816 INFO L378 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 50 treesize of output 45 [2024-11-17 00:49:31,822 INFO L378 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 24 treesize of output 11 [2024-11-17 00:49:31,943 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-17 00:49:31,943 INFO L378 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 19 treesize of output 22 [2024-11-17 00:49:31,964 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-17 00:49:31,964 INFO L378 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 29 treesize of output 28 [2024-11-17 00:49:32,088 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:49:32,088 INFO L378 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 30 treesize of output 32 [2024-11-17 00:49:32,108 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:49:32,108 INFO L378 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 63 treesize of output 50 [2024-11-17 00:49:32,549 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-17 00:49:32,549 INFO L378 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 2 case distinctions, treesize of input 74 treesize of output 59 [2024-11-17 00:49:32,574 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:49:32,574 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 35 [2024-11-17 00:49:32,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:32,613 INFO L378 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 2 case distinctions, treesize of input 66 treesize of output 49 [2024-11-17 00:49:32,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:32,632 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 21 [2024-11-17 00:49:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:49:32,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:33,192 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-17 00:49:33,193 INFO L378 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 21 treesize of output 20 [2024-11-17 00:49:33,309 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |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 (or (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1324 Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.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_1324)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1323 (Array Int Int))) (or (not (= v_ArrVal_1323 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1323 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1323) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1327) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1324 Int)) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$#1.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_1324)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1326) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)))))) is different from false [2024-11-17 00:49:33,328 INFO L378 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 117 treesize of output 115 [2024-11-17 00:49:33,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:33,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 122 [2024-11-17 00:49:33,348 INFO L378 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 0 case distinctions, treesize of input 109 treesize of output 96 [2024-11-17 00:49:33,351 INFO L378 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 [2024-11-17 00:49:33,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:33,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 59 treesize of output 66 [2024-11-17 00:49:33,366 INFO L378 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 49 treesize of output 45 [2024-11-17 00:49:33,371 INFO L378 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 45 treesize of output 41 [2024-11-17 00:49:33,375 INFO L378 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 78 treesize of output 60 [2024-11-17 00:49:33,381 INFO L378 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 35 treesize of output 27 [2024-11-17 00:49:33,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:33,393 INFO L378 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 16 treesize of output 10 [2024-11-17 00:49:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 1 not checked. [2024-11-17 00:49:34,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909596496] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:34,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 13] total 41 [2024-11-17 00:49:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158748696] [2024-11-17 00:49:34,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:34,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-17 00:49:34,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:34,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-17 00:49:34,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1500, Unknown=4, NotChecked=78, Total=1722 [2024-11-17 00:49:34,125 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 42 states have internal predecessors, (122), 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) [2024-11-17 00:49:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:35,370 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2024-11-17 00:49:35,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-17 00:49:35,371 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 42 states have internal predecessors, (122), 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 50 [2024-11-17 00:49:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:35,372 INFO L225 Difference]: With dead ends: 94 [2024-11-17 00:49:35,372 INFO L226 Difference]: Without dead ends: 94 [2024-11-17 00:49:35,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=319, Invalid=2651, Unknown=4, NotChecked=106, Total=3080 [2024-11-17 00:49:35,373 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 102 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:35,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 552 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1013 Invalid, 0 Unknown, 64 Unchecked, 0.6s Time] [2024-11-17 00:49:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-17 00:49:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2024-11-17 00:49:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 82 states have internal predecessors, (89), 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) [2024-11-17 00:49:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-17 00:49:35,376 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 50 [2024-11-17 00:49:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:35,377 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-17 00:49:35,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 42 states have internal predecessors, (122), 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) [2024-11-17 00:49:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-17 00:49:35,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:49:35,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:35,378 INFO L215 NwaCegarLoop]: trace histogram [5, 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] [2024-11-17 00:49:35,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 00:49:35,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 00:49:35,579 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:35,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:35,579 INFO L85 PathProgramCache]: Analyzing trace with hash -373022084, now seen corresponding path program 1 times [2024-11-17 00:49:35,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:35,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119777060] [2024-11-17 00:49:35,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:35,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:49:36,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:36,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119777060] [2024-11-17 00:49:36,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119777060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938224449] [2024-11-17 00:49:36,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:36,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:36,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:36,927 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) [2024-11-17 00:49:36,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:49:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:37,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-17 00:49:37,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:37,141 INFO L378 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 [2024-11-17 00:49:37,216 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:49:37,216 INFO L378 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 [2024-11-17 00:49:37,253 INFO L378 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 [2024-11-17 00:49:37,261 INFO L378 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 [2024-11-17 00:49:37,297 INFO L378 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 23 treesize of output 11 [2024-11-17 00:49:37,302 INFO L378 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 23 treesize of output 11 [2024-11-17 00:49:37,324 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:49:37,324 INFO L378 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 50 treesize of output 45 [2024-11-17 00:49:37,329 INFO L378 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 24 treesize of output 11 [2024-11-17 00:49:37,430 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-17 00:49:37,430 INFO L378 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 29 treesize of output 28 [2024-11-17 00:49:37,457 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-17 00:49:37,457 INFO L378 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 19 treesize of output 18 [2024-11-17 00:49:37,533 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:49:37,533 INFO L378 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 63 treesize of output 50 [2024-11-17 00:49:37,553 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:49:37,554 INFO L378 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 30 treesize of output 32 [2024-11-17 00:49:37,891 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:49:37,891 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 35 [2024-11-17 00:49:37,900 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-17 00:49:37,901 INFO L378 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 2 case distinctions, treesize of input 74 treesize of output 59 [2024-11-17 00:49:37,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:37,948 INFO L378 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 2 case distinctions, treesize of input 66 treesize of output 49 [2024-11-17 00:49:37,956 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-17 00:49:37,956 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2024-11-17 00:49:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:49:38,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:38,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:38,572 INFO L378 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 46 treesize of output 50 [2024-11-17 00:49:38,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_1579 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (.cse3 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_1580 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) 1)))) (forall ((v_ArrVal_1579 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (forall ((v_ArrVal_1580 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) .cse3)) .cse0) (forall ((v_ArrVal_1580 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< .cse4 .cse3) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse4)))) (forall ((v_ArrVal_1580 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse5) (< 0 (+ .cse5 1))))) (or (forall ((v_ArrVal_1580 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (forall ((v_ArrVal_1579 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) is different from false [2024-11-17 00:49:38,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse7 (forall ((v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1578 Int)) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1577 (Array Int Int))) (or (forall ((v_ArrVal_1580 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1577) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse0) (< .cse0 .cse1)))) (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1577 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1577)))) (or (forall ((v_ArrVal_1577 (Array Int Int)) (v_ArrVal_1580 (Array Int Int))) (or (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1577 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1577)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1577) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))) (forall ((v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1578 Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)))) (forall ((v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1578 Int)) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse5)))) (forall ((v_ArrVal_1577 (Array Int Int))) (or (forall ((v_ArrVal_1580 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1577) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (< 0 (+ 1 .cse6)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse6)))) (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1577 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1577)))) (or .cse7 (forall ((v_ArrVal_1577 (Array Int Int)) (v_ArrVal_1580 (Array Int Int))) (or (< 0 (+ 1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1577) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1577 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1577))))) (or .cse7 (forall ((v_ArrVal_1577 (Array Int Int)) (v_ArrVal_1580 (Array Int Int))) (or (not (= (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1577 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1577)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1577) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse1))))))) is different from false [2024-11-17 00:49:38,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:38,769 INFO L378 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 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-17 00:49:38,771 INFO L378 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 36 treesize of output 24 [2024-11-17 00:49:38,774 INFO L378 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 7 treesize of output 3 [2024-11-17 00:49:38,776 INFO L378 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 44 treesize of output 42 [2024-11-17 00:49:38,780 INFO L378 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 9 treesize of output 5 [2024-11-17 00:49:38,786 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-17 00:49:38,787 INFO L378 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 1 [2024-11-17 00:49:38,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:38,793 INFO L378 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 25 treesize of output 31 [2024-11-17 00:49:38,795 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:38,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-17 00:49:38,798 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:38,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-11-17 00:49:38,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:38,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-17 00:49:38,811 INFO L378 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 18 treesize of output 10 [2024-11-17 00:49:38,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:38,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-17 00:49:38,822 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:38,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-17 00:49:38,826 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:38,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-17 00:49:38,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:38,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-17 00:49:38,836 INFO L378 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 16 treesize of output 8 [2024-11-17 00:49:38,842 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-17 00:49:38,842 INFO L378 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 25 treesize of output 1 [2024-11-17 00:49:38,844 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:38,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-17 00:49:38,851 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:38,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2024-11-17 00:49:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 2 not checked. [2024-11-17 00:49:39,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938224449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:39,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:39,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 13] total 42 [2024-11-17 00:49:39,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734294475] [2024-11-17 00:49:39,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:39,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-17 00:49:39,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:39,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-17 00:49:39,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1503, Unknown=2, NotChecked=158, Total=1806 [2024-11-17 00:49:39,030 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 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) [2024-11-17 00:49:40,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:40,804 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-17 00:49:40,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 00:49:40,805 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 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 50 [2024-11-17 00:49:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:40,805 INFO L225 Difference]: With dead ends: 93 [2024-11-17 00:49:40,805 INFO L226 Difference]: Without dead ends: 93 [2024-11-17 00:49:40,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=373, Invalid=3055, Unknown=2, NotChecked=230, Total=3660 [2024-11-17 00:49:40,807 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 63 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:40,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 659 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1091 Invalid, 0 Unknown, 124 Unchecked, 0.7s Time] [2024-11-17 00:49:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-17 00:49:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2024-11-17 00:49:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 84 states have internal predecessors, (91), 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) [2024-11-17 00:49:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-17 00:49:40,809 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 50 [2024-11-17 00:49:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:40,810 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-17 00:49:40,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 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) [2024-11-17 00:49:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-17 00:49:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:49:40,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:40,810 INFO L215 NwaCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1] [2024-11-17 00:49:40,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-17 00:49:41,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-17 00:49:41,012 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:41,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:41,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1993413031, now seen corresponding path program 1 times [2024-11-17 00:49:41,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:41,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080308514] [2024-11-17 00:49:41,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:41,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:49:41,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:41,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080308514] [2024-11-17 00:49:41,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080308514] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:41,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611115634] [2024-11-17 00:49:41,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:41,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:41,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:41,872 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) [2024-11-17 00:49:41,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 00:49:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:42,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-17 00:49:42,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:42,089 INFO L378 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 [2024-11-17 00:49:42,121 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:49:42,121 INFO L378 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 [2024-11-17 00:49:42,139 INFO L378 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 [2024-11-17 00:49:42,158 INFO L378 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 25 treesize of output 13 [2024-11-17 00:49:42,169 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 00:49:42,169 INFO L378 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 31 treesize of output 32 [2024-11-17 00:49:42,203 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:49:42,204 INFO L378 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 19 treesize of output 18 [2024-11-17 00:49:42,206 INFO L378 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 [2024-11-17 00:49:42,225 INFO L378 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 0 case distinctions, treesize of input 40 treesize of output 24 [2024-11-17 00:49:42,323 INFO L378 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 36 treesize of output 27 [2024-11-17 00:49:42,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:42,422 INFO L378 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 28 treesize of output 10 [2024-11-17 00:49:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 00:49:42,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:42,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1833 (Array Int Int))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset| (select v_ArrVal_1833 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) v_ArrVal_1833)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_main_~head~1#1.base|) (+ |c_ULTIMATE.start_main_~head~1#1.offset| 8))) 1) (not (= (select v_ArrVal_1833 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)) |c_ULTIMATE.start_main_~head~1#1.base|)))) is different from false [2024-11-17 00:49:42,659 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-17 00:49:42,659 INFO L378 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 12 treesize of output 11 [2024-11-17 00:49:42,812 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (v_ArrVal_1830 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1829)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1830) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1831) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2024-11-17 00:49:42,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:42,824 INFO L378 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 29 treesize of output 35 [2024-11-17 00:49:42,827 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:42,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-17 00:49:42,831 INFO L378 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 [2024-11-17 00:49:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 1 not checked. [2024-11-17 00:49:42,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611115634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:49:42,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:49:42,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 46 [2024-11-17 00:49:42,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126167445] [2024-11-17 00:49:42,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:49:42,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-17 00:49:42,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:49:42,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-17 00:49:42,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1729, Unknown=12, NotChecked=170, Total=2070 [2024-11-17 00:49:42,903 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 46 states, 46 states have (on average 2.5869565217391304) internal successors, (119), 46 states have internal predecessors, (119), 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) [2024-11-17 00:49:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:49:43,815 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2024-11-17 00:49:43,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:49:43,815 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.5869565217391304) internal successors, (119), 46 states have internal predecessors, (119), 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 52 [2024-11-17 00:49:43,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:49:43,816 INFO L225 Difference]: With dead ends: 92 [2024-11-17 00:49:43,816 INFO L226 Difference]: Without dead ends: 92 [2024-11-17 00:49:43,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=329, Invalid=2859, Unknown=12, NotChecked=222, Total=3422 [2024-11-17 00:49:43,817 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:49:43,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 597 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 981 Invalid, 0 Unknown, 128 Unchecked, 0.5s Time] [2024-11-17 00:49:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-17 00:49:43,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2024-11-17 00:49:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 84 states have internal predecessors, (90), 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) [2024-11-17 00:49:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-17 00:49:43,819 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 52 [2024-11-17 00:49:43,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:49:43,819 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-17 00:49:43,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.5869565217391304) internal successors, (119), 46 states have internal predecessors, (119), 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) [2024-11-17 00:49:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-17 00:49:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 00:49:43,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:49:43,820 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:49:43,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-17 00:49:44,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-17 00:49:44,021 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 30 more)] === [2024-11-17 00:49:44,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:49:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1303547853, now seen corresponding path program 1 times [2024-11-17 00:49:44,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:49:44,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901751113] [2024-11-17 00:49:44,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:49:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:49:46,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:49:46,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901751113] [2024-11-17 00:49:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901751113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:49:46,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822664826] [2024-11-17 00:49:46,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:49:46,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:49:46,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:49:46,167 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) [2024-11-17 00:49:46,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 00:49:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:49:46,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-17 00:49:46,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:49:46,559 INFO L378 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 [2024-11-17 00:49:46,612 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:49:46,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:49:46,652 INFO L378 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 27 treesize of output 11 [2024-11-17 00:49:46,735 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:49:46,735 INFO L378 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 [2024-11-17 00:49:46,786 INFO L378 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 15 treesize of output 1 [2024-11-17 00:49:46,793 INFO L378 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 16 treesize of output 11 [2024-11-17 00:49:46,806 INFO L378 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 [2024-11-17 00:49:46,869 INFO L378 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 16 treesize of output 11 [2024-11-17 00:49:46,875 INFO L378 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 23 treesize of output 11 [2024-11-17 00:49:46,883 INFO L378 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 23 treesize of output 11 [2024-11-17 00:49:46,903 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-17 00:49:46,903 INFO L378 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 79 treesize of output 68 [2024-11-17 00:49:46,907 INFO L378 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 39 treesize of output 15 [2024-11-17 00:49:46,913 INFO L378 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 24 treesize of output 11 [2024-11-17 00:49:47,050 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-17 00:49:47,051 INFO L378 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 19 treesize of output 22 [2024-11-17 00:49:47,069 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-17 00:49:47,069 INFO L378 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 31 treesize of output 30 [2024-11-17 00:49:47,075 INFO L378 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 23 treesize of output 11 [2024-11-17 00:49:47,160 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:49:47,161 INFO L378 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 30 treesize of output 32 [2024-11-17 00:49:47,190 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2024-11-17 00:49:47,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 49 treesize of output 59 [2024-11-17 00:49:47,201 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:49:47,201 INFO L378 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 76 treesize of output 59 [2024-11-17 00:49:47,762 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-17 00:49:47,762 INFO L378 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 2 case distinctions, treesize of input 78 treesize of output 63 [2024-11-17 00:49:47,776 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-17 00:49:47,776 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 35 [2024-11-17 00:49:47,802 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2024-11-17 00:49:47,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 49 treesize of output 59 [2024-11-17 00:49:47,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:47,851 INFO L378 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 2 case distinctions, treesize of input 70 treesize of output 53 [2024-11-17 00:49:47,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:47,858 INFO L378 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 21 [2024-11-17 00:49:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:49:48,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:49:51,352 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse2))) (and (or (forall ((v_ArrVal_2094 (Array Int Int)) (v_prenex_31 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_2094) .cse0) v_prenex_31)) (< v_prenex_31 0) (< .cse1 v_prenex_31))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (forall ((v_ArrVal_2094 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_2094) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|)) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_41| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (< .cse1 |v_ULTIMATE.start_main_~ptr~0#1.offset_41|)))))) is different from false [2024-11-17 00:49:51,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2))) (and (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_2094 (Array Int Int)) (v_prenex_31 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2094) .cse0) v_prenex_31)) (< v_prenex_31 0) (< .cse1 v_prenex_31)))) (forall ((v_ArrVal_2094 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (< .cse1 |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2094) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|))))))) is different from false [2024-11-17 00:49:51,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_2088 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_2094 (Array Int Int)) (v_prenex_31 Int)) (or (< v_prenex_31 0) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) v_prenex_31) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2094) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)) v_prenex_31) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)) (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_2088 .cse1)) v_ArrVal_2088)))) (forall ((v_ArrVal_2088 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_2094 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int)) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_41| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2094) (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0)) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|)))) (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_2088 .cse1)) v_ArrVal_2088)))))) is different from false [2024-11-17 00:49:51,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2088 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_2088 .cse0)) v_ArrVal_2088)) (forall ((v_ArrVal_2094 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_41| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2094) (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_ArrVal_2088 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_2088 .cse0)) v_ArrVal_2088)) (forall ((v_ArrVal_2094 (Array Int Int)) (v_prenex_31 Int)) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) v_prenex_31) (< v_prenex_31 0) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2094) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) v_prenex_31) |c_ULTIMATE.start_main_~data_init~0#1|))) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |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_~new_head~0#1.base|))))) is different from false [2024-11-17 00:49:51,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse6 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_2085 (Array Int Int))) (or (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2088 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_2084 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2085))) (or (forall ((v_ArrVal_2094 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_41| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2084))) (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |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) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) (= (select (select (store (store .cse3 |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2094) (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2083))) (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)) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (store (select .cse3 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_2088 .cse1)) v_ArrVal_2088))))) (not (= v_ArrVal_2085 (store .cse5 .cse6 (select v_ArrVal_2085 .cse6)))))) (forall ((v_ArrVal_2085 (Array Int Int))) (or (not (= v_ArrVal_2085 (store .cse5 .cse6 (select v_ArrVal_2085 .cse6)))) (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2088 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_2084 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2083)) (.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2085))) (or (forall ((v_ArrVal_2094 (Array Int Int)) (v_prenex_31 Int)) (or (= (select (select (store (store .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2094) (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) v_prenex_31) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_31 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_31))) (= (select (select (store .cse8 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse8 |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_~new_head~0#1.base|) (not (= (store (select .cse7 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_2088 .cse1)) v_ArrVal_2088))))))))) is different from false [2024-11-17 00:49:51,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse6 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_2082 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2082 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2082)) (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 Int) (v_ArrVal_2085 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2080))) (or (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2088 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_2084 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2079)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2083))) (or (not (= (store (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2085) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 (select v_ArrVal_2088 .cse2)) v_ArrVal_2088)) (= (select (select (store .cse3 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse3 |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_~new_head~0#1.base|) (forall ((v_ArrVal_2094 (Array Int Int)) (v_prenex_31 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2082) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) v_prenex_31) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2085) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2094) (select (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4)) v_prenex_31)) (< v_prenex_31 0)))))) (not (= v_ArrVal_2085 (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse6 (select v_ArrVal_2085 .cse6))))))))) (forall ((v_ArrVal_2082 (Array Int Int))) (or (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 Int) (v_ArrVal_2085 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2080))) (or (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2088 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_2084 (Array Int Int))) (or (not (= (store (select (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2085) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 (select v_ArrVal_2088 .cse2)) v_ArrVal_2088)) (forall ((v_ArrVal_2094 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_41| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2085) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2094) (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2079)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2083))) (store .cse8 |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse8 |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_ULTIMATE.start_main_~ptr~0#1.offset_41|)) (< (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2082) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2084))) (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.offset|))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|))))) (not (= v_ArrVal_2085 (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse6 (select v_ArrVal_2085 .cse6))))))) (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2082 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2082)))))) is different from false [2024-11-17 00:49:51,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:51,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 321 treesize of output 302 [2024-11-17 00:49:51,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:51,962 INFO L378 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1060 treesize of output 1060 [2024-11-17 00:49:51,989 INFO L378 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 619 treesize of output 599 [2024-11-17 00:49:52,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:52,034 INFO L378 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 1655 treesize of output 1652 [2024-11-17 00:49:52,075 INFO L378 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 727 treesize of output 723 [2024-11-17 00:49:52,103 INFO L378 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 743 treesize of output 727 [2024-11-17 00:49:52,135 INFO L378 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 756 treesize of output 736 [2024-11-17 00:49:52,178 INFO L378 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 751 treesize of output 735 [2024-11-17 00:49:52,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:49:52,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-17 00:49:52,311 INFO L378 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 23 treesize of output 15 [2024-11-17 00:49:54,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-17 00:49:54,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-17 00:49:56,146 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:56,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:56,181 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,197 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:56,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:56,217 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:56,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:56,251 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,269 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:56,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:56,292 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:56,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:56,306 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,322 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,337 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:56,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:56,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:56,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:56,372 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,516 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,533 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:56,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:56,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:56,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:56,663 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,688 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,710 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:56,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:56,731 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:56,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:56,741 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,777 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:56,791 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:57,545 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:57,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:57,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:58,090 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:58,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:58,129 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,142 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:58,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:58,157 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:58,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:58,165 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,187 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:58,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:58,195 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,567 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,583 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,620 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:58,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:58,706 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,735 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,746 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,814 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,826 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,843 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:58,852 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:59,107 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:59,125 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:59,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:59,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:59,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:59,234 INFO L378 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 13 treesize of output 1 [2024-11-17 00:49:59,308 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:49:59,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:49:59,325 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:00,175 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:00,194 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:00,536 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:00,566 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:00,671 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:00,696 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:02,522 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:02,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:02,565 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:03,347 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:03,359 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:03,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:03,375 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:03,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:03,388 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:03,447 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:03,466 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:03,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:03,513 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:03,532 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:03,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:03,557 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:03,575 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:03,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:03,598 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:03,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:03,616 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:03,650 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:03,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:03,672 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:03,707 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:03,726 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:03,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:03,751 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:03,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:03,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:03,785 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:03,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:03,802 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:03,829 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:50:03,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 1 [2024-11-17 00:50:03,844 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:06,896 INFO L378 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 9435 treesize of output 9291 [2024-11-17 00:50:16,845 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse5 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse24 (and .cse5 .cse6)) (.cse25 (not .cse6)) (.cse7 (not .cse5)) (.cse21 (not .cse18)) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (and (forall ((v_prenex_2327 Int) (v_prenex_2330 (Array Int Int)) (v_prenex_2331 Int) (v_prenex_2329 Int) (v_prenex_2328 (Array Int Int)) (v_prenex_2325 (Array Int Int)) (v_prenex_2326 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2328) v_prenex_2329 v_prenex_2325) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2330)) (.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2326))) (or (= v_prenex_2329 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse0 v_prenex_2331) v_prenex_2327) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2327) (< v_prenex_2327 0) (= v_prenex_2327 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2327) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2328) v_prenex_2329) .cse2 (select v_prenex_2325 .cse2)) v_prenex_2325)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_2330 v_prenex_2327)) (not (= v_prenex_2328 (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_2328 .cse3)))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2327)))) (or (and (forall ((v_prenex_1747 (Array Int Int)) (v_prenex_1748 (Array Int Int)) (v_prenex_1751 Int) (v_prenex_1750 (Array Int Int)) (v_prenex_1752 (Array Int Int)) (v_prenex_1749 Int)) (or (= (select v_prenex_1752 v_prenex_1749) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1749 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1750 (store .cse4 .cse3 (select v_prenex_1750 .cse3)))) (< v_prenex_1749 0) (= v_prenex_1751 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1750) v_prenex_1751 v_prenex_1747) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1752) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1749)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1749) (= v_prenex_1751 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1747 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1748) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1750) v_prenex_1751) .cse2 (select v_prenex_1747 .cse2)))))) (forall ((v_prenex_2198 (Array Int Int)) (v_prenex_2201 Int) (v_prenex_2197 (Array Int Int)) (v_prenex_2202 (Array Int Int)) (v_prenex_2200 (Array Int Int)) (v_prenex_2199 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2200) v_prenex_2201 v_prenex_2197) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2202) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2199) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2201 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2199) (< v_prenex_2199 0) (= v_prenex_2199 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2198) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2200) v_prenex_2201) .cse2 (select v_prenex_2197 .cse2)) v_prenex_2197)) (not (= v_prenex_2200 (store .cse4 .cse3 (select v_prenex_2200 .cse3)))) (= v_prenex_2201 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse5) (or .cse6 (and (or (forall ((v_prenex_2304 Int) (v_prenex_2312 (Array Int Int)) (v_prenex_2310 (Array Int Int))) (or (not (= (store .cse4 .cse3 (select v_prenex_2310 .cse3)) v_prenex_2310)) (= v_prenex_2304 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2310) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2312) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2304) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2304) (< v_prenex_2304 0))) .cse5) (or (and (forall ((v_prenex_1985 Int) (v_prenex_2306 Int) (v_prenex_1987 (Array Int Int)) (v_prenex_1986 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1985) (< v_prenex_1985 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1986) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1987) v_prenex_2306) v_prenex_1985) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1985 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select v_prenex_1987 v_prenex_1985) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_2307 (Array Int Int)) (v_prenex_2311 Int) (v_prenex_2305 (Array Int Int)) (v_prenex_2309 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2305) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2307) v_prenex_2309) v_prenex_2311) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2311) (= v_prenex_2311 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2311 0)))) .cse7) (forall ((v_prenex_1989 (Array Int Int)) (v_prenex_2308 (Array Int Int)) (v_prenex_1990 (Array Int Int)) (v_prenex_1991 Int) (v_prenex_1988 Int)) (let ((.cse8 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1989) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1990))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1988) (< v_prenex_1988 0) (not (= v_prenex_1989 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2308) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_1989 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse8 v_prenex_1991) v_prenex_1988)) (= (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1988) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1988 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or .cse5 (forall ((v_prenex_1992 Int) (v_prenex_1994 (Array Int Int)) (v_prenex_1993 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1993) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1994) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1992)) (= (select v_prenex_1994 v_prenex_1992) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1992 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1992 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1992) (not (= v_prenex_1993 (store .cse4 .cse3 (select v_prenex_1993 .cse3))))))))) (forall ((v_prenex_2260 (Array Int Int)) (v_prenex_2264 (Array Int Int)) (v_prenex_2262 (Array Int Int)) (v_prenex_2263 Int) (v_prenex_2265 Int) (v_prenex_2259 (Array Int Int)) (v_prenex_2261 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2260)) (.cse10 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2262) v_prenex_2263 v_prenex_2259) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2264))) (or (not (= v_prenex_2259 (store (select (store .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2262) v_prenex_2263) .cse2 (select v_prenex_2259 .cse2)))) (= (select (select .cse10 v_prenex_2265) v_prenex_2261) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2261 0) (= (select v_prenex_2264 v_prenex_2261) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2261 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_2262 (store (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_2262 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2261)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2261) (= v_prenex_2263 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_2263 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (and (or (forall ((v_prenex_1656 Int) (v_prenex_1654 Int) (v_prenex_1651 (Array Int Int)) (v_prenex_1653 (Array Int Int)) (v_prenex_1652 (Array Int Int)) (v_prenex_1655 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1654) (< v_prenex_1654 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1655) v_prenex_1656 v_prenex_1653) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1651) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1654) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1652) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1655) v_prenex_1656) .cse2 (select v_prenex_1653 .cse2)) v_prenex_1653)) (not (= v_prenex_1655 (store .cse4 .cse3 (select v_prenex_1655 .cse3)))))) .cse6) (forall ((v_prenex_2140 (Array Int Int)) (v_prenex_2139 Int) (v_prenex_2141 Int) (v_prenex_2136 (Array Int Int)) (v_prenex_2137 (Array Int Int)) (v_prenex_2138 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2140) v_prenex_2141 v_prenex_2138) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2136) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2139) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2139 0) (not (= v_prenex_2138 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2137) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2140) v_prenex_2141) .cse2 (select v_prenex_2138 .cse2)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2139) (not (= v_prenex_2140 (store .cse4 .cse3 (select v_prenex_2140 .cse3)))) (= v_prenex_2141 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse5) (or .cse5 .cse6 (and (forall ((v_prenex_2182 (Array Int Int)) (v_prenex_2180 Int) (v_prenex_2179 (Array Int Int)) (v_prenex_2181 Int)) (let ((.cse11 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2182) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2179))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2181)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2181) (not (= v_prenex_2182 (store .cse4 .cse3 (select v_prenex_2182 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse11 v_prenex_2180) v_prenex_2181)) (< v_prenex_2181 0)))) (forall ((v_prenex_1671 (Array Int Int)) (v_prenex_1672 Int) (v_prenex_1673 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1673) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1671) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1672) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1673 (store .cse4 .cse3 (select v_prenex_1673 .cse3)))) (< v_prenex_1672 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1672))) (forall ((v_prenex_1676 Int) (v_prenex_1675 Int) (v_prenex_1674 (Array Int Int)) (v_prenex_1677 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1677) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1674))) (or (= v_prenex_1675 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1677 (store .cse4 .cse3 (select v_prenex_1677 .cse3)))) (= (select (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1676) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1676 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1676) (= (select (select .cse12 v_prenex_1675) v_prenex_1676) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_prenex_2116 Int) (v_prenex_2118 Int) (v_prenex_2114 (Array Int Int)) (v_prenex_2120 Int) (v_prenex_2115 (Array Int Int)) (v_prenex_2119 (Array Int Int)) (v_prenex_2117 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2117) v_prenex_2118 v_prenex_2114) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2119)) (.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2115))) (or (= (select (select .cse13 v_prenex_2120) v_prenex_2116) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_2117 (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_2117 .cse3)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2116) (= v_prenex_2118 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2116)) (not (= v_prenex_2114 (store (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2117) v_prenex_2118) .cse2 (select v_prenex_2114 .cse2)))) (< v_prenex_2116 0) (= v_prenex_2116 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or .cse7 (and (forall ((v_prenex_1637 (Array Int Int)) (v_prenex_1635 Int) (v_prenex_1636 (Array Int Int)) (v_prenex_1638 Int)) (or (< v_prenex_1635 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1635) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1635) (= v_prenex_1635 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1636) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1637) v_prenex_1638) v_prenex_1635) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1637 v_prenex_1635)))) (forall ((v_prenex_2129 Int) (v_prenex_2126 Int) (v_prenex_2127 (Array Int Int)) (v_prenex_2128 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2126) (< v_prenex_2126 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2127) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2128) v_prenex_2129) v_prenex_2126) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2126 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2126))))) (forall ((v_prenex_2336 Int) (v_prenex_2338 Int) (v_prenex_2334 Int) (v_prenex_2335 (Array Int Int)) (v_prenex_2332 (Array Int Int)) (v_prenex_2333 (Array Int Int)) (v_prenex_2337 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2335) v_prenex_2336 v_prenex_2332) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2337)) (.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2333))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2334) (= v_prenex_2336 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2334)) (= (select (select .cse15 v_prenex_2338) v_prenex_2334) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_2332 (store (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2335) v_prenex_2336) .cse2 (select v_prenex_2332 .cse2)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_2337 v_prenex_2334)) (< v_prenex_2334 0) (not (= v_prenex_2335 (store (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_2335 .cse3)))) (= v_prenex_2334 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or (and (forall ((v_prenex_1954 Int) (v_prenex_1955 (Array Int Int)) (v_prenex_1952 Int) (v_prenex_1950 (Array Int Int)) (v_prenex_1951 (Array Int Int)) (v_prenex_1956 Int) (v_prenex_1953 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1953) v_prenex_1954 v_prenex_1950) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1955) v_prenex_1956) v_prenex_1952)) (< v_prenex_1952 0) (= v_prenex_1952 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1952) (not (= v_prenex_1950 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1951) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1953) v_prenex_1954) .cse2 (select v_prenex_1950 .cse2)))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1952) (not (= v_prenex_1953 (store v_prenex_1951 .cse3 (select v_prenex_1953 .cse3)))) (= v_prenex_1954 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_2282 (Array Int Int)) (v_prenex_2280 (Array Int Int)) (v_prenex_2281 (Array Int Int)) (v_prenex_2277 Int) (v_prenex_2278 Int) (v_prenex_2279 (Array Int Int)) (v_prenex_2276 Int)) (let ((.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2281) v_prenex_2277 v_prenex_2279) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2282))) (or (not (= v_prenex_2281 (store v_prenex_2280 .cse3 (select v_prenex_2281 .cse3)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2276) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2276)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2276) (< v_prenex_2276 0) (= v_prenex_2277 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_2279 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2280) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2281) v_prenex_2277) .cse2 (select v_prenex_2279 .cse2)))) (= v_prenex_2276 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 v_prenex_2278) v_prenex_2276)))))) .cse7) (or (and (or .cse7 (and (or (forall ((v_prenex_1921 Int) (v_prenex_1922 (Array Int Int)) (v_prenex_1923 Int) (v_prenex_1920 (Array Int Int))) (or (< v_prenex_1921 0) (= v_prenex_1923 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1920) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1922) v_prenex_1923) v_prenex_1921) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse18) (or (forall ((v_prenex_1910 Int) (v_prenex_1911 (Array Int Int)) (v_prenex_1909 (Array Int Int)) (v_prenex_1912 Int)) (let ((.cse19 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1911) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1909))) (or (= (select (select .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1912) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1912 0) (= (select (select .cse19 v_prenex_1910) v_prenex_1912) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1910 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse18) (or (forall ((v_prenex_1913 (Array Int Int)) (v_prenex_1915 (Array Int Int)) (v_prenex_1916 Int) (v_prenex_1914 Int)) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1915) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1913))) (or (= v_prenex_1914 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1916)) (< v_prenex_1916 0) (= (select (select .cse20 v_prenex_1914) v_prenex_1916) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse21) (or (forall ((v_prenex_1905 (Array Int Int)) (v_prenex_1907 (Array Int Int)) (v_prenex_1908 Int) (v_prenex_1906 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1907) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1905) v_prenex_1906) v_prenex_1908) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1906 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1908 0))) .cse21))) (or (and (or (forall ((v_prenex_1901 (Array Int Int)) (v_prenex_1903 (Array Int Int)) (v_prenex_1904 Int) (v_prenex_1902 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1904) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1903) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1901) v_prenex_1902) v_prenex_1904) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1904 0) (= v_prenex_1902 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse18) (or .cse21 (forall ((v_prenex_2240 (Array Int Int)) (v_prenex_2244 (Array Int Int)) (v_prenex_2242 Int) (v_prenex_2243 Int)) (or (< v_prenex_2243 0) (= v_prenex_2242 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2240) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2244) v_prenex_2242) v_prenex_2243) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2243))))) .cse7) (or (forall ((v_prenex_1934 (Array Int Int)) (v_prenex_1935 Int) (v_prenex_1932 (Array Int Int)) (v_prenex_1931 (Array Int Int)) (v_prenex_1933 Int)) (let ((.cse22 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1934) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1931))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1935) (= (select (select .cse22 v_prenex_1933) v_prenex_1935) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1934 (store (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1932) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_1934 .cse3)) .cse2 (select v_prenex_1934 .cse2)))) (< v_prenex_1935 0) (= v_prenex_1933 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1935) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse18) (or (forall ((v_prenex_1924 (Array Int Int)) (v_prenex_1926 (Array Int Int)) (v_prenex_2241 (Array Int Int)) (v_prenex_1927 Int) (v_prenex_1925 Int)) (let ((.cse23 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1926) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1924))) (or (< v_prenex_1927 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1927) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse23 v_prenex_1925) v_prenex_1927)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1927)) (= v_prenex_1925 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1926 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2241) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_1926 .cse2))))))) .cse21) (or .cse5 (and (or (forall ((v_prenex_1918 (Array Int Int)) (v_prenex_1917 (Array Int Int)) (v_prenex_1919 Int)) (or (not (= (store .cse4 .cse2 (select v_prenex_1918 .cse2)) v_prenex_1918)) (< v_prenex_1919 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1919) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1918) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1917) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1919)))) .cse21) (or .cse18 (forall ((v_prenex_1930 Int) (v_prenex_1929 (Array Int Int)) (v_prenex_1928 (Array Int Int))) (or (< v_prenex_1930 0) (not (= v_prenex_1929 (store (store .cse4 .cse3 (select v_prenex_1929 .cse3)) .cse2 (select v_prenex_1929 .cse2)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1929) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1928) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1930)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1930))))))) .cse24) (or (forall ((v_prenex_2205 Int) (v_prenex_2208 (Array Int Int)) (v_prenex_2207 Int) (v_prenex_2203 (Array Int Int)) (v_prenex_2206 (Array Int Int)) (v_prenex_2204 (Array Int Int))) (or (= v_prenex_2205 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= v_prenex_2207 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2205 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2205) (= (select v_prenex_2208 v_prenex_2205) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2206) v_prenex_2207 v_prenex_2203) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2208) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2205)) (not (= v_prenex_2206 (store .cse4 .cse3 (select v_prenex_2206 .cse3)))) (not (= v_prenex_2203 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2204) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2206) v_prenex_2207) .cse2 (select v_prenex_2203 .cse2)))))) .cse25 .cse5) (or (forall ((v_prenex_2294 (Array Int Int)) (v_prenex_2297 (Array Int Int)) (v_prenex_2295 (Array Int Int)) (v_prenex_2296 Int) (v_prenex_2299 (Array Int Int)) (v_prenex_2298 Int)) (or (= v_prenex_2298 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_2297 (store .cse4 .cse3 (select v_prenex_2297 .cse3)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2297) v_prenex_2298 v_prenex_2294) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2299) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2296) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2296 0) (not (= v_prenex_2294 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2295) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2297) v_prenex_2298) .cse2 (select v_prenex_2294 .cse2)))) (= v_prenex_2296 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2296))) .cse5) (or (and (forall ((v_prenex_2176 (Array Int Int)) (v_prenex_2178 Int) (v_prenex_2177 (Array Int Int)) (v_prenex_2175 Int)) (let ((.cse26 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2176) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2177))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2175) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2175)) (= v_prenex_2175 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 v_prenex_2178) v_prenex_2175)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2175) (< v_prenex_2175 0)))) (forall ((v_prenex_1666 Int) (v_prenex_1663 Int) (v_prenex_1664 (Array Int Int)) (v_prenex_1665 (Array Int Int))) (or (< v_prenex_1663 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1664) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1665) v_prenex_1666) v_prenex_1663) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1663) (= v_prenex_1663 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1663))) (forall ((v_prenex_1669 (Array Int Int)) (v_prenex_1667 Int) (v_prenex_1670 Int) (v_prenex_1668 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1667) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1668) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1669) v_prenex_1670) v_prenex_1667) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_1669 v_prenex_1667) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1667) (= v_prenex_1667 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1667 0)))) .cse7) (or (and (or .cse18 (forall ((v_prenex_1969 (Array Int Int)) (v_prenex_1972 Int) (v_prenex_1970 Int) (v_prenex_1971 (Array Int Int))) (or (< v_prenex_1970 0) (= v_prenex_1970 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1969) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1971) v_prenex_1972) v_prenex_1970)) (= (select v_prenex_1971 v_prenex_1970) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_prenex_2286 (Array Int Int)) (v_prenex_2285 (Array Int Int)) (v_prenex_2284 Int) (v_prenex_2283 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2285) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2286) v_prenex_2284) v_prenex_2283) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2283 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2283 0))) .cse21) (or .cse18 (forall ((v_prenex_1957 (Array Int Int)) (v_prenex_1959 (Array Int Int)) (v_prenex_1960 Int) (v_prenex_1958 Int)) (let ((.cse27 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1957) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1959))) (or (= (select (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1958) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1958 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1958 0) (= (select (select .cse27 v_prenex_1960) v_prenex_1958) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_prenex_1976 Int) (v_prenex_1974 Int) (v_prenex_1973 (Array Int Int)) (v_prenex_1975 (Array Int Int))) (or (= v_prenex_1974 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1973) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1975) v_prenex_1976) v_prenex_1974) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1974 0))) .cse18) (or .cse21 (forall ((v_prenex_1967 (Array Int Int)) (v_prenex_1968 Int) (v_prenex_1965 (Array Int Int)) (v_prenex_1966 Int)) (or (= v_prenex_1966 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1965) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1967) v_prenex_1968) v_prenex_1966) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1967 v_prenex_1966)) (< v_prenex_1966 0)))) (or (forall ((v_prenex_1964 Int) (v_prenex_1962 Int) (v_prenex_1961 (Array Int Int)) (v_prenex_1963 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1961) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1963))) (or (= v_prenex_1962 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1962)) (< v_prenex_1962 0) (= (select (select .cse28 v_prenex_1964) v_prenex_1962) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse21)) .cse6 .cse7) (or .cse7 (forall ((v_prenex_2292 (Array Int Int)) (v_prenex_2287 (Array Int Int)) (v_prenex_2289 Int) (v_prenex_2288 (Array Int Int)) (v_prenex_2291 Int) (v_prenex_2290 (Array Int Int)) (v_prenex_2293 Int)) (let ((.cse29 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2290) v_prenex_2291 v_prenex_2287) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2292))) (or (< v_prenex_2289 0) (not (= v_prenex_2287 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2288) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2290) v_prenex_2291) .cse2 (select v_prenex_2287 .cse2)))) (not (= v_prenex_2290 (store v_prenex_2288 .cse3 (select v_prenex_2290 .cse3)))) (= v_prenex_2289 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= v_prenex_2291 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse29 v_prenex_2293) v_prenex_2289) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2289) (= (select (select .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2289) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and (or (forall ((v_prenex_1576 Int) (v_prenex_1578 (Array Int Int)) (v_prenex_1577 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1577) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1578) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1576) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1577 (store .cse4 .cse3 (select v_prenex_1577 .cse3)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1576) (< v_prenex_1576 0) (= v_prenex_1576 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select v_prenex_1578 v_prenex_1576) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse5) (forall ((v_prenex_70 (Array Int Int)) (v_prenex_1566 Int) (v_prenex_1563 Int) (v_prenex_1565 (Array Int Int)) (v_prenex_1564 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1564) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1565))) (or (= (select (select .cse30 v_prenex_1566) v_prenex_1563) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_1565 v_prenex_1563) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1563) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1563 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1564 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_70) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_1564 .cse3)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1563) (< v_prenex_1563 0)))) (or (and (forall ((v_prenex_1549 (Array Int Int)) (v_prenex_1550 (Array Int Int)) (v_prenex_1551 Int) (v_prenex_1548 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1548) (< v_prenex_1548 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1549) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1550) v_prenex_1551) v_prenex_1548)) (= v_prenex_1548 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_prenex_1547 Int) (v_prenex_1544 Int) (v_prenex_1545 (Array Int Int)) (v_prenex_1546 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1545) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1546) v_prenex_1547) v_prenex_1544)) (= v_prenex_1544 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1544 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1544) (= (select v_prenex_1546 v_prenex_1544) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_1575 Int) (v_prenex_1574 (Array Int Int)) (v_prenex_1572 Int) (v_prenex_1573 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1573) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1574))) (or (= (select (select .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1572) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1572 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1572) (= v_prenex_1572 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse31 v_prenex_1575) v_prenex_1572) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse7) (or (and (forall ((v_prenex_1535 Int) (v_prenex_1532 Int) (v_prenex_1534 (Array Int Int)) (v_prenex_1533 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1533) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1534))) (or (< v_prenex_1532 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1532) (= (select (select .cse32 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1532) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1532 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse32 v_prenex_1535) v_prenex_1532) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1555 Int) (v_prenex_1552 Int) (v_prenex_1554 (Array Int Int)) (v_prenex_1553 (Array Int Int))) (or (= v_prenex_1552 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1552) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1553) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1554) v_prenex_1555) v_prenex_1552)) (< v_prenex_1552 0) (= (select v_prenex_1554 v_prenex_1552) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_1538 (Array Int Int)) (v_prenex_1536 Int) (v_prenex_1537 (Array Int Int)) (v_prenex_1539 Int)) (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1537) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1538))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 v_prenex_1539) v_prenex_1536)) (< v_prenex_1536 0) (= (select (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1536) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1536 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1536))))) .cse7) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_41| Int) (v_prenex_74 (Array Int Int)) (v_prenex_68 (Array Int Int)) (v_arrayElimCell_147 Int)) (let ((.cse34 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_74) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_68))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) (not (= (store .cse4 .cse3 (select v_prenex_74 .cse3)) v_prenex_74)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_41| 0) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_41| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse34 v_arrayElimCell_147) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_41|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1527 (Array Int Int)) (v_prenex_1528 (Array Int Int)) (v_prenex_1526 Int)) (or (< v_prenex_1526 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1527) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1528) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1526)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1526) (not (= v_prenex_1527 (store .cse4 .cse3 (select v_prenex_1527 .cse3)))) (= v_prenex_1526 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_prenex_1525 Int) (v_prenex_1522 Int) (v_prenex_1523 (Array Int Int)) (v_prenex_1524 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1523) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1524))) (or (not (= v_prenex_1523 (store .cse4 .cse3 (select v_prenex_1523 .cse3)))) (= v_prenex_1522 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1522 0) (= (select v_prenex_1524 v_prenex_1522) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse35 v_prenex_1525) v_prenex_1522) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse35 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1522) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1522)))) (forall ((v_prenex_1530 (Array Int Int)) (v_prenex_1531 (Array Int Int)) (v_prenex_1529 Int)) (or (not (= v_prenex_1530 (store .cse4 .cse3 (select v_prenex_1530 .cse3)))) (< v_prenex_1529 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1530) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1531) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1529) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1529 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select v_prenex_1531 v_prenex_1529) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1529))))) (or .cse7 (and (forall ((v_prenex_1543 Int) (v_prenex_1540 Int) (v_prenex_1541 (Array Int Int)) (v_prenex_1542 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1541) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1542) v_prenex_1543) v_prenex_1540) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1540 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1540 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1540))) (forall ((v_prenex_1561 (Array Int Int)) (v_prenex_1560 (Array Int Int)) (v_prenex_1562 Int) (v_prenex_1559 Int)) (or (= (select v_prenex_1561 v_prenex_1559) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1559 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1559) (< v_prenex_1559 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1560) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1561) v_prenex_1562) v_prenex_1559) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_prenex_1568 Int) (v_prenex_1570 (Array Int Int)) (v_prenex_1571 Int) (v_prenex_1567 (Array Int Int)) (v_prenex_1569 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1569) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1570))) (or (not (= v_prenex_1569 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1567) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_1569 .cse3)))) (< v_prenex_1568 0) (= (select (select .cse36 v_prenex_1571) v_prenex_1568) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1568) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1568) (= v_prenex_1568 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or (forall ((v_prenex_1556 Int) (v_prenex_1558 (Array Int Int)) (v_prenex_1557 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1556) (not (= v_prenex_1557 (store .cse4 .cse3 (select v_prenex_1557 .cse3)))) (< v_prenex_1556 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1557) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1558) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1556) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1556 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) .cse5)) .cse6) (or .cse7 (forall ((v_prenex_2154 (Array Int Int)) (v_prenex_2156 Int) (v_prenex_2155 (Array Int Int)) (v_prenex_2158 Int) (v_prenex_2159 (Array Int Int)) (v_prenex_2157 (Array Int Int)) (v_prenex_2160 Int)) (or (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2155) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2159) v_prenex_2160) .cse2 (select v_prenex_2157 .cse2)) v_prenex_2157)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2159) v_prenex_2160 v_prenex_2157) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2154) v_prenex_2156) v_prenex_2158)) (= v_prenex_2160 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_2159 (store v_prenex_2155 .cse3 (select v_prenex_2159 .cse3)))) (= v_prenex_2156 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2158 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2158)))) (forall ((v_prenex_2151 (Array Int Int)) (v_prenex_2152 (Array Int Int)) (v_prenex_2153 Int) (v_prenex_2150 Int) (v_prenex_2149 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2151) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2152))) (or (= v_prenex_2150 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2150 0) (= (select (select .cse37 v_prenex_2153) v_prenex_2150) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_2151 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2149) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_2151 .cse3)))) (= (select v_prenex_2152 v_prenex_2150) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2150) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2150) (= (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2150) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse24 (and (or (and (or (forall ((v_prenex_1617 (Array Int Int)) (v_prenex_1616 (Array Int Int)) (v_prenex_1619 (Array Int Int)) (v_prenex_1620 Int) (v_prenex_1618 Int)) (let ((.cse38 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1616) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1619))) (or (< v_prenex_1618 0) (not (= v_prenex_1616 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1617) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_1616 .cse2)))) (= (select (select .cse38 v_prenex_1620) v_prenex_1618) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1618)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1618) (= v_prenex_1618 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse21) (or (forall ((v_prenex_1626 (Array Int Int)) (v_prenex_1625 (Array Int Int)) (v_prenex_1628 (Array Int Int)) (v_prenex_1629 Int) (v_prenex_1627 Int)) (let ((.cse39 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1625) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1628))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 v_prenex_1629) v_prenex_1627)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1627) (= v_prenex_1627 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1625 (store (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1626) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_1625 .cse3)) .cse2 (select v_prenex_1625 .cse2)))) (= (select (select .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1627) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1627 0)))) .cse18)) .cse6) (or (forall ((v_prenex_1634 Int) (v_prenex_1632 Int) (v_prenex_1631 (Array Int Int)) (v_prenex_1630 (Array Int Int)) (v_prenex_1633 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1630) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1633))) (or (= v_prenex_1632 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1632 0) (= (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1632) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse40 v_prenex_1634) v_prenex_1632) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1630 (store (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1631) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_1630 .cse3)) .cse2 (select v_prenex_1630 .cse2)))) (= (select v_prenex_1633 v_prenex_1632) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1632)))) .cse18) (or (and (or .cse21 (forall ((v_prenex_1624 Int) (v_prenex_1622 Int) (v_prenex_1621 (Array Int Int)) (v_prenex_1623 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1621) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1623))) (or (< v_prenex_1622 0) (= (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1622) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1622 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1622) (= (select (select .cse41 v_prenex_1624) v_prenex_1622) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_prenex_1613 Int) (v_prenex_1614 (Array Int Int)) (v_prenex_1615 Int) (v_prenex_1612 (Array Int Int))) (let ((.cse42 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1612) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1614))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1613) (= v_prenex_1613 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1613 0) (= (select (select .cse42 v_prenex_1615) v_prenex_1613) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1613) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse18)) .cse7) (or (forall ((v_prenex_2125 (Array Int Int)) (v_prenex_2123 (Array Int Int)) (v_prenex_2121 Int) (v_prenex_2122 Int) (v_prenex_2124 (Array Int Int))) (let ((.cse43 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2123) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2125))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_2125 v_prenex_2121)) (= v_prenex_2121 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2121) (not (= v_prenex_2123 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2124) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_2123 .cse2)))) (= (select (select .cse43 v_prenex_2122) v_prenex_2121) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2121) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2121 0)))) .cse21))) (or (and (or (forall ((v_prenex_2342 (Array Int Int)) (v_prenex_2340 Int) (v_prenex_2341 Int) (v_prenex_2339 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2342) v_prenex_2340) v_prenex_2341) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2341 0) (= v_prenex_2340 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse18) (or (forall ((v_prenex_2024 Int) (v_prenex_2023 (Array Int Int)) (v_prenex_2021 (Array Int Int)) (v_prenex_2022 Int)) (let ((.cse44 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2023) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2021))) (or (= v_prenex_2022 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 v_prenex_2022) v_prenex_2024)) (< v_prenex_2024 0) (= (select (select .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse18) (or (forall ((v_prenex_2014 Int) (v_prenex_2016 Int) (v_prenex_2015 (Array Int Int)) (v_prenex_2013 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2016) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2015) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2013) v_prenex_2014) v_prenex_2016) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2014 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2016 0))) .cse18) (or (forall ((v_prenex_2018 Int) (v_prenex_2020 Int) (v_prenex_2019 (Array Int Int)) (v_prenex_2017 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2019) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2017) v_prenex_2018) v_prenex_2020) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2020 0) (= v_prenex_2018 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse21) (or .cse21 (forall ((v_prenex_2006 Int) (v_prenex_2008 Int) (v_prenex_2005 (Array Int Int)) (v_prenex_2007 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2008) (= v_prenex_2006 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2007) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2005) v_prenex_2006) v_prenex_2008) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2008 0)))) (or (forall ((v_prenex_2031 (Array Int Int)) (v_prenex_2032 Int) (v_prenex_2029 (Array Int Int)) (v_prenex_2030 Int)) (let ((.cse45 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2031) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2029))) (or (= (select (select .cse45 v_prenex_2030) v_prenex_2032) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2032 0) (= (select (select .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2032) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2030 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse21) (or (forall ((v_prenex_2028 Int) (v_prenex_2026 Int) (v_prenex_2027 (Array Int Int)) (v_prenex_2025 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2027) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2025))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2028) (= v_prenex_2026 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2028 0) (= (select (select .cse46 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2028) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse46 v_prenex_2026) v_prenex_2028) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse21) (or .cse18 (forall ((v_prenex_2011 (Array Int Int)) (v_prenex_2010 Int) (v_prenex_2012 Int) (v_prenex_2009 (Array Int Int))) (let ((.cse47 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2011) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2009))) (or (< v_prenex_2012 0) (= (select (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2012) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2012) (= (select (select .cse47 v_prenex_2010) v_prenex_2012) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2010 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) .cse6 .cse7) (or .cse7 (and (forall ((v_prenex_2073 (Array Int Int)) (v_prenex_2072 (Array Int Int)) (v_prenex_2077 (Array Int Int)) (v_prenex_2075 (Array Int Int)) (v_prenex_2076 Int) (v_prenex_2078 Int) (v_prenex_2074 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2077) v_prenex_2078 v_prenex_2075) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2072) v_prenex_2074) v_prenex_2076)) (not (= v_prenex_2075 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2073) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2077) v_prenex_2078) .cse2 (select v_prenex_2075 .cse2)))) (= v_prenex_2078 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_2074 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2076 0) (not (= v_prenex_2077 (store v_prenex_2073 .cse3 (select v_prenex_2077 .cse3)))))) (forall ((v_prenex_2352 (Array Int Int)) (v_prenex_2353 (Array Int Int)) (v_prenex_2355 Int) (v_prenex_2350 (Array Int Int)) (v_prenex_2356 Int) (v_prenex_2351 Int) (v_prenex_2354 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2352) v_prenex_2356 v_prenex_2350) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2353))) (or (= v_prenex_2355 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2351 0) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2354) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2352) v_prenex_2356) .cse2 (select v_prenex_2350 .cse2)) v_prenex_2350)) (not (= v_prenex_2352 (store v_prenex_2354 .cse3 (select v_prenex_2352 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2351)) (= v_prenex_2356 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse48 v_prenex_2355) v_prenex_2351))))))) (or (forall ((v_prenex_2313 Int) (v_prenex_2314 (Array Int Int)) (v_prenex_2315 (Array Int Int))) (or (not (= v_prenex_2314 (store .cse4 .cse3 (select v_prenex_2314 .cse3)))) (= v_prenex_2313 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2314) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2315) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2313) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2313) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2313) (< v_prenex_2313 0))) .cse5) (or .cse25 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1)) (or (forall ((v_prenex_2275 (Array Int Int)) (v_prenex_2274 (Array Int Int)) (v_prenex_2273 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2274) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2275) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2273)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_2275 v_prenex_2273)) (not (= v_prenex_2274 (store .cse4 .cse3 (select v_prenex_2274 .cse3)))) (< v_prenex_2273 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2273) (= v_prenex_2273 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2273))) .cse5) (forall ((v_prenex_2173 (Array Int Int)) (v_prenex_2171 (Array Int Int)) (v_prenex_2174 Int) (v_prenex_2169 (Array Int Int)) (v_prenex_2168 (Array Int Int)) (v_prenex_2170 Int) (v_prenex_2172 Int)) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2171) v_prenex_2172 v_prenex_2168) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2173)) (.cse50 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2169))) (or (= (select (select .cse49 v_prenex_2174) v_prenex_2170) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2170) (not (= v_prenex_2171 (store (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_2171 .cse3)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2170) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2170)) (= v_prenex_2170 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (store (select (store .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2171) v_prenex_2172) .cse2 (select v_prenex_2168 .cse2)) v_prenex_2168)) (= (select v_prenex_2173 v_prenex_2170) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2170 0)))) (or (and (or (forall ((v_prenex_1820 Int) (v_prenex_1817 (Array Int Int)) (v_prenex_1819 (Array Int Int)) (v_prenex_1818 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1817) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1819) v_prenex_1820) v_prenex_1818)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1818) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1818) (= v_prenex_1818 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1818 0))) .cse18) (or (forall ((v_prenex_1824 (Array Int Int)) (v_prenex_1826 (Array Int Int)) (v_prenex_1827 Int) (v_prenex_1825 Int) (v_prenex_1822 (Array Int Int)) (v_prenex_1821 (Array Int Int)) (v_prenex_1823 Int)) (or (not (= v_prenex_1824 (store v_prenex_1822 .cse3 (select v_prenex_1824 .cse3)))) (< v_prenex_1823 0) (= v_prenex_1823 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1823) (not (= v_prenex_1821 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1822) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1824) v_prenex_1825) .cse2 (select v_prenex_1821 .cse2)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1824) v_prenex_1825 v_prenex_1821) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1826) v_prenex_1827) v_prenex_1823) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1826 v_prenex_1823)))) .cse6) (or (and (or (forall ((v_prenex_2215 Int) (v_prenex_2225 Int) (v_prenex_2226 (Array Int Int)) (v_prenex_2216 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2226) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2216))) (or (= (select (select .cse51 v_prenex_2225) v_prenex_2215) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2215) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2215 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2215) (= v_prenex_2215 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse18) (or (forall ((v_prenex_1802 (Array Int Int)) (v_prenex_1804 (Array Int Int)) (v_prenex_1805 Int) (v_prenex_1803 Int)) (let ((.cse52 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1802) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1804))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1803)) (= v_prenex_1803 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1803) (< v_prenex_1803 0) (= (select (select .cse52 v_prenex_1805) v_prenex_1803) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse21)) .cse6) (forall ((v_prenex_1854 Int) (v_prenex_1852 Int) (v_prenex_1851 (Array Int Int)) (v_prenex_1850 (Array Int Int)) (v_prenex_1853 (Array Int Int)) (v_prenex_1855 (Array Int Int)) (v_prenex_1856 Int)) (let ((.cse53 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1853) v_prenex_1854 v_prenex_1850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1855))) (or (not (= v_prenex_1853 (store v_prenex_1851 .cse3 (select v_prenex_1853 .cse3)))) (= (select (select .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1852) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1850 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1851) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1853) v_prenex_1854) .cse2 (select v_prenex_1850 .cse2)))) (= v_prenex_1852 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1852 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1852) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1852) (= (select (select .cse53 v_prenex_1856) v_prenex_1852) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1898 Int) (v_prenex_1896 Int) (v_prenex_1895 (Array Int Int)) (v_prenex_1894 (Array Int Int)) (v_prenex_1897 (Array Int Int)) (v_prenex_1899 (Array Int Int)) (v_prenex_1900 Int)) (let ((.cse54 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1897) v_prenex_1898 v_prenex_1894) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1899))) (or (not (= v_prenex_1897 (store v_prenex_1895 .cse3 (select v_prenex_1897 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1896)) (= v_prenex_1896 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1896 0) (not (= v_prenex_1894 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1895) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1897) v_prenex_1898) .cse2 (select v_prenex_1894 .cse2)))) (= v_prenex_1898 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse54 v_prenex_1900) v_prenex_1896) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (and (or (forall ((v_prenex_1833 Int) (v_prenex_1834 (Array Int Int)) (v_prenex_1835 Int) (v_prenex_1832 (Array Int Int))) (or (< v_prenex_1833 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1833) (= v_prenex_1833 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1832) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1834) v_prenex_1835) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse21) (or .cse18 (forall ((v_prenex_2217 Int) (v_prenex_2218 Int) (v_prenex_2224 (Array Int Int)) (v_prenex_2223 (Array Int Int))) (or (= v_prenex_2218 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2218) (< v_prenex_2218 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2223) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2224) v_prenex_2217) v_prenex_2218) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse6) (forall ((v_prenex_1767 Int) (v_prenex_1768 (Array Int Int)) (v_prenex_1770 (Array Int Int)) (v_prenex_1771 Int) (v_prenex_1765 (Array Int Int)) (v_prenex_1769 Int) (v_prenex_1766 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1768) v_prenex_1769 v_prenex_1765) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1770))) (or (= (select (select .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1767) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1769 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1767 0) (not (= v_prenex_1768 (store v_prenex_1766 .cse3 (select v_prenex_1768 .cse3)))) (= v_prenex_1767 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse55 v_prenex_1771) v_prenex_1767) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1766) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1768) v_prenex_1769) .cse2 (select v_prenex_1765 .cse2)) v_prenex_1765))))) (forall ((v_prenex_1798 Int) (v_prenex_1800 (Array Int Int)) (v_prenex_1799 (Array Int Int)) (v_prenex_1801 Int)) (let ((.cse56 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1799) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1800))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1798) (= (select (select .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1798) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse56 v_prenex_1801) v_prenex_1798) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1798 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1798 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1798)))) (forall ((v_prenex_1810 Int) (v_prenex_1806 (Array Int Int)) (v_prenex_1807 (Array Int Int)) (v_prenex_1808 Int) (v_prenex_1809 (Array Int Int)) (v_prenex_1811 (Array Int Int)) (v_prenex_1812 Int)) (let ((.cse57 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1809) v_prenex_1810 v_prenex_1806) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1811))) (or (not (= v_prenex_1806 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1807) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1809) v_prenex_1810) .cse2 (select v_prenex_1806 .cse2)))) (= (select (select .cse57 v_prenex_1812) v_prenex_1808) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1808 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= v_prenex_1810 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse57 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1808) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1808 0) (not (= v_prenex_1809 (store v_prenex_1807 .cse3 (select v_prenex_1809 .cse3))))))) (forall ((v_prenex_1878 (Array Int Int)) (v_prenex_1876 Int) (v_prenex_1877 (Array Int Int)) (v_prenex_1879 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1876) (= (select v_prenex_1878 v_prenex_1876) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1876) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1877) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1878) v_prenex_1879) v_prenex_1876) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1876 0) (= v_prenex_1876 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_prenex_1868 (Array Int Int)) (v_prenex_1871 Int) (v_prenex_1870 (Array Int Int)) (v_prenex_1869 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1868) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1870) v_prenex_1871) v_prenex_1869)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1869) (< v_prenex_1869 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1869) (= v_prenex_1869 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) .cse21) (or (forall ((v_prenex_1797 Int) (v_prenex_1795 Int) (v_prenex_1794 (Array Int Int)) (v_prenex_1796 (Array Int Int))) (let ((.cse58 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1794) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1796))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1795) (< v_prenex_1795 0) (= v_prenex_1795 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse58 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1795) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse58 v_prenex_1797) v_prenex_1795) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1795)))) .cse21) (or .cse6 (forall ((v_prenex_2238 Int) (v_prenex_1764 Int) (v_prenex_1761 Int) (v_prenex_2235 (Array Int Int)) (v_prenex_1763 (Array Int Int)) (v_prenex_1762 (Array Int Int)) (v_prenex_2234 (Array Int Int))) (let ((.cse59 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1762) v_prenex_2238 v_prenex_2234) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1763))) (or (< v_prenex_1761 0) (= v_prenex_2238 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_2234 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2235) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1762) v_prenex_2238) .cse2 (select v_prenex_2234 .cse2)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse59 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1761)) (not (= v_prenex_1762 (store v_prenex_2235 .cse3 (select v_prenex_1762 .cse3)))) (= v_prenex_1761 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse59 v_prenex_1764) v_prenex_1761)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1761))))) (or (and (or .cse18 (forall ((v_prenex_2239 Int) (v_prenex_2214 Int) (v_prenex_2233 (Array Int Int)) (v_prenex_2227 (Array Int Int))) (or (= v_prenex_2239 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2233) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2227) v_prenex_2214) v_prenex_2239) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2239) (< v_prenex_2239 0) (= (select v_prenex_2227 v_prenex_2239) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_prenex_1813 (Array Int Int)) (v_prenex_1815 (Array Int Int)) (v_prenex_1816 Int) (v_prenex_1814 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1814) (= v_prenex_1814 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1813) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1815) v_prenex_1816) v_prenex_1814)) (= (select v_prenex_1815 v_prenex_1814) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1814 0))) .cse21)) .cse6) (forall ((v_prenex_1846 (Array Int Int)) (v_prenex_1848 (Array Int Int)) (v_prenex_1849 Int) (v_prenex_1847 Int) (v_prenex_1844 (Array Int Int)) (v_prenex_1845 Int) (v_prenex_1843 (Array Int Int))) (or (= v_prenex_1845 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1845 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1846) v_prenex_1847 v_prenex_1843) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1848) v_prenex_1849) v_prenex_1845)) (not (= v_prenex_1846 (store v_prenex_1844 .cse3 (select v_prenex_1846 .cse3)))) (= v_prenex_1847 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_1843 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1844) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1846) v_prenex_1847) .cse2 (select v_prenex_1843 .cse2)))))) (forall ((v_prenex_1864 Int) (v_prenex_1866 (Array Int Int)) (v_prenex_1865 (Array Int Int)) (v_prenex_1867 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1865) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1866) v_prenex_1867) v_prenex_1864)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1864) (< v_prenex_1864 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1864) (= v_prenex_1864 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (forall ((v_prenex_1779 (Array Int Int)) (v_prenex_1781 (Array Int Int)) (v_prenex_1782 Int) (v_prenex_1780 Int)) (let ((.cse60 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1779) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1781))) (or (= (select (select .cse60 v_prenex_1782) v_prenex_1780) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1780) (= v_prenex_1780 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1780 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1780) (= (select (select .cse60 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1780) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse18) (or (and (forall ((v_prenex_2237 Int) (v_prenex_2232 (Array Int Int)) (v_prenex_2236 (Array Int Int)) (v_prenex_2209 Int)) (or (< v_prenex_2237 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2236) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2232) v_prenex_2209) v_prenex_2237)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2237) (= v_prenex_2237 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select v_prenex_2232 v_prenex_2237) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_1756 Int) (v_prenex_1753 Int) (v_prenex_1754 (Array Int Int)) (v_prenex_1755 (Array Int Int))) (let ((.cse61 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1754) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1755))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1753) (= v_prenex_1753 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1753 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse61 v_prenex_1756) v_prenex_1753)) (= (select (select .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1753) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1758 (Array Int Int)) (v_prenex_1759 (Array Int Int)) (v_prenex_1760 Int) (v_prenex_1757 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1757) (< v_prenex_1757 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1758) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1759) v_prenex_1760) v_prenex_1757)) (= v_prenex_1757 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse6) (or .cse6 (forall ((v_prenex_1789 Int) (v_prenex_1787 Int) (v_prenex_1785 Int) (v_prenex_1783 (Array Int Int)) (v_prenex_1784 (Array Int Int)) (v_prenex_1786 (Array Int Int)) (v_prenex_1788 (Array Int Int))) (let ((.cse62 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1786) v_prenex_1787 v_prenex_1783) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1788))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1785) (< v_prenex_1785 0) (= (select (select .cse62 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1785) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1786 (store v_prenex_1784 .cse3 (select v_prenex_1786 .cse3)))) (= v_prenex_1785 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1783 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1784) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1786) v_prenex_1787) .cse2 (select v_prenex_1783 .cse2)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse62 v_prenex_1789) v_prenex_1785)))))) (or .cse18 (forall ((v_prenex_1790 (Array Int Int)) (v_prenex_1792 (Array Int Int)) (v_prenex_1793 Int) (v_prenex_1791 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1792 v_prenex_1791)) (< v_prenex_1791 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1791) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1791) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1790) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1792) v_prenex_1793) v_prenex_1791)) (= v_prenex_1791 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_prenex_1778 Int) (v_prenex_1776 Int) (v_prenex_1774 Int) (v_prenex_1772 (Array Int Int)) (v_prenex_1773 (Array Int Int)) (v_prenex_1775 (Array Int Int)) (v_prenex_1777 (Array Int Int))) (or (not (= v_prenex_1775 (store v_prenex_1773 .cse3 (select v_prenex_1775 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1777 v_prenex_1774)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1775) v_prenex_1776 v_prenex_1772) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1777) v_prenex_1778) v_prenex_1774) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1774 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1774) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1774) (= v_prenex_1774 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1772 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1773) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1775) v_prenex_1776) .cse2 (select v_prenex_1772 .cse2)))))) (forall ((v_prenex_1886 Int) (v_prenex_1884 Int) (v_prenex_1880 (Array Int Int)) (v_prenex_1882 Int) (v_prenex_1881 (Array Int Int)) (v_prenex_1883 (Array Int Int)) (v_prenex_1885 (Array Int Int))) (or (= v_prenex_1882 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1882 0) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1881) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1883) v_prenex_1884) .cse2 (select v_prenex_1880 .cse2)) v_prenex_1880)) (not (= v_prenex_1883 (store v_prenex_1881 .cse3 (select v_prenex_1883 .cse3)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1883) v_prenex_1884 v_prenex_1880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1885) v_prenex_1886) v_prenex_1882) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1884 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1885 v_prenex_1882)))) (forall ((v_prenex_1837 (Array Int Int)) (v_prenex_1842 Int) (v_prenex_1836 (Array Int Int)) (v_prenex_1839 (Array Int Int)) (v_prenex_1840 Int) (v_prenex_1838 Int) (v_prenex_1841 (Array Int Int))) (let ((.cse63 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1839) v_prenex_1840 v_prenex_1836) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1841))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse63 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1838)) (not (= v_prenex_1839 (store v_prenex_1837 .cse3 (select v_prenex_1839 .cse3)))) (= v_prenex_1838 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1836 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1837) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1839) v_prenex_1840) .cse2 (select v_prenex_1836 .cse2)))) (< v_prenex_1838 0) (= v_prenex_1840 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse63 v_prenex_1842) v_prenex_1838) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse25 (forall ((v_prenex_1857 (Array Int Int)) (v_prenex_1858 (Array Int Int)) (v_prenex_1863 Int) (v_prenex_1861 Int) (v_prenex_1860 (Array Int Int)) (v_prenex_1862 (Array Int Int)) (v_prenex_1859 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1860) v_prenex_1861 v_prenex_1857) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1862) v_prenex_1863) v_prenex_1859) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1859 0) (not (= v_prenex_1857 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1858) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1860) v_prenex_1861) .cse2 (select v_prenex_1857 .cse2)))) (= v_prenex_1859 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select v_prenex_1862 v_prenex_1859) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1860 (store v_prenex_1858 .cse3 (select v_prenex_1860 .cse3)))) (= v_prenex_1861 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (and (or (forall ((v_prenex_2231 (Array Int Int)) (v_prenex_2211 Int) (v_prenex_2230 (Array Int Int)) (v_prenex_2210 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2211) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2230) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2231) v_prenex_2210) v_prenex_2211) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2211 0) (= v_prenex_2211 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) .cse18) (or (forall ((v_prenex_2212 Int) (v_prenex_2213 Int) (v_prenex_2228 (Array Int Int)) (v_prenex_2229 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2213) (= v_prenex_2213 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2213 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2228) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2229) v_prenex_2212) v_prenex_2213) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse21) (or (forall ((v_prenex_1829 Int) (v_prenex_1828 Int) (v_prenex_1831 (Array Int Int)) (v_prenex_1830 (Array Int Int))) (or (= v_prenex_1828 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1830) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1831) v_prenex_1829) v_prenex_1828) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1828 0) (= (select v_prenex_1831 v_prenex_1828) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1828))) .cse21) (or (forall ((v_prenex_2221 (Array Int Int)) (v_prenex_2222 (Array Int Int)) (v_prenex_2220 Int) (v_prenex_2219 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2220) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_2222 v_prenex_2220)) (= v_prenex_2220 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2220 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2221) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2222) v_prenex_2219) v_prenex_2220) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse18)) .cse6) (forall ((v_prenex_1893 Int) (v_prenex_1890 (Array Int Int)) (v_prenex_1891 Int) (v_prenex_1892 (Array Int Int)) (v_prenex_1888 (Array Int Int)) (v_prenex_1887 (Array Int Int)) (v_prenex_1889 Int)) (or (not (= v_prenex_1890 (store v_prenex_1888 .cse3 (select v_prenex_1890 .cse3)))) (= v_prenex_1891 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_1889 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1890) v_prenex_1891 v_prenex_1887) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1892) v_prenex_1893) v_prenex_1889)) (not (= v_prenex_1887 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1888) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1890) v_prenex_1891) .cse2 (select v_prenex_1887 .cse2)))) (< v_prenex_1889 0))) (or (forall ((v_prenex_1875 Int) (v_prenex_1873 Int) (v_prenex_1872 (Array Int Int)) (v_prenex_1874 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1873) (= v_prenex_1873 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select v_prenex_1874 v_prenex_1873) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1873 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1872) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1874) v_prenex_1875) v_prenex_1873) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1873))) .cse21)) .cse7) (or (and (or .cse6 (and (forall ((v_prenex_2066 (Array Int Int)) (v_prenex_2068 Int) (v_prenex_2069 Int) (v_prenex_2067 (Array Int Int)) (v_prenex_2065 (Array Int Int)) (v_prenex_2071 Int) (v_prenex_2070 (Array Int Int))) (let ((.cse64 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2066) v_prenex_2071 v_prenex_2065) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2070))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2069)) (< v_prenex_2069 0) (not (= v_prenex_2066 (store .cse4 .cse3 (select v_prenex_2066 .cse3)))) (= v_prenex_2068 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse64 v_prenex_2068) v_prenex_2069) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2069) (not (= v_prenex_2065 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2067) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2066) v_prenex_2071) .cse2 (select v_prenex_2065 .cse2))))))) (forall ((v_prenex_2050 (Array Int Int)) (v_prenex_2049 Int) (v_prenex_2048 (Array Int Int)) (v_prenex_2046 (Array Int Int)) (v_prenex_2047 (Array Int Int)) (v_prenex_2051 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2050) v_prenex_2051 v_prenex_2048) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2046) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2049)) (not (= v_prenex_2048 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2047) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2050) v_prenex_2051) .cse2 (select v_prenex_2048 .cse2)))) (not (= v_prenex_2050 (store .cse4 .cse3 (select v_prenex_2050 .cse3)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2049) (< v_prenex_2049 0))) (forall ((v_prenex_2033 (Array Int Int)) (v_prenex_2036 Int) (v_prenex_2034 (Array Int Int)) (v_prenex_2038 Int) (v_prenex_2037 (Array Int Int)) (v_prenex_2035 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2037) v_prenex_2038 v_prenex_2035) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2033) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2036) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_2035 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2034) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2037) v_prenex_2038) .cse2 (select v_prenex_2035 .cse2)))) (< v_prenex_2036 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2036) (= v_prenex_2038 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_2037 (store .cse4 .cse3 (select v_prenex_2037 .cse3)))))) (forall ((v_prenex_2040 (Array Int Int)) (v_prenex_2044 (Array Int Int)) (v_prenex_2042 (Array Int Int)) (v_prenex_2043 Int) (v_prenex_2045 Int) (v_prenex_2039 (Array Int Int)) (v_prenex_2041 Int)) (let ((.cse65 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2044) v_prenex_2045 v_prenex_2042) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2039))) (or (not (= v_prenex_2042 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2040) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2044) v_prenex_2045) .cse2 (select v_prenex_2042 .cse2)))) (= v_prenex_2045 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_2044 (store .cse4 .cse3 (select v_prenex_2044 .cse3)))) (= (select (select .cse65 v_prenex_2041) v_prenex_2043) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2043) (< v_prenex_2043 0) (= (select (select .cse65 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2043) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_prenex_2052 (Array Int Int)) (v_prenex_2057 Int) (v_prenex_2056 (Array Int Int)) (v_prenex_2053 (Array Int Int)) (v_prenex_2054 (Array Int Int)) (v_prenex_2055 Int)) (or (< v_prenex_2055 0) (not (= v_prenex_2054 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2053) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2056) v_prenex_2057) .cse2 (select v_prenex_2054 .cse2)))) (= v_prenex_2057 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2055) (not (= v_prenex_2056 (store .cse4 .cse3 (select v_prenex_2056 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2056) v_prenex_2057 v_prenex_2054) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2052) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2055)))) (or (forall ((v_prenex_2347 Int) (v_prenex_2349 Int) (v_prenex_2346 Int) (v_prenex_2345 (Array Int Int)) (v_prenex_2343 (Array Int Int)) (v_prenex_2344 (Array Int Int)) (v_prenex_2348 (Array Int Int))) (let ((.cse66 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2344) v_prenex_2349 v_prenex_2343) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2348))) (or (= v_prenex_2346 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse66 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2347)) (not (= v_prenex_2344 (store .cse4 .cse3 (select v_prenex_2344 .cse3)))) (not (= v_prenex_2343 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2345) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2344) v_prenex_2349) .cse2 (select v_prenex_2343 .cse2)))) (< v_prenex_2347 0) (= (select (select .cse66 v_prenex_2346) v_prenex_2347) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2349 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2347)))) .cse6) (forall ((v_prenex_2063 (Array Int Int)) (v_prenex_2061 (Array Int Int)) (v_prenex_2064 Int) (v_prenex_2059 (Array Int Int)) (v_prenex_2058 (Array Int Int)) (v_prenex_2060 Int) (v_prenex_2062 Int)) (let ((.cse67 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2063) v_prenex_2064 v_prenex_2061) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2058))) (or (not (= v_prenex_2063 (store .cse4 .cse3 (select v_prenex_2063 .cse3)))) (= (select (select .cse67 v_prenex_2060) v_prenex_2062) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse67 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2062)) (< v_prenex_2062 0) (not (= v_prenex_2061 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2059) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2063) v_prenex_2064) .cse2 (select v_prenex_2061 .cse2)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2062) (= v_prenex_2064 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse5) (or .cse7 (and (or .cse18 (forall ((v_prenex_1705 (Array Int Int)) (v_prenex_1707 (Array Int Int)) (v_prenex_1708 Int) (v_prenex_1706 Int)) (or (= v_prenex_1706 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1705) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1707) v_prenex_1708) v_prenex_1706)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1706) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1707 v_prenex_1706)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1706) (< v_prenex_1706 0)))) (forall ((v_prenex_1734 Int) (v_prenex_1732 Int) (v_prenex_1730 Int) (v_prenex_1729 (Array Int Int)) (v_prenex_1728 (Array Int Int)) (v_prenex_1731 (Array Int Int)) (v_prenex_1733 (Array Int Int))) (or (< v_prenex_1730 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1730) (= v_prenex_1730 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= v_prenex_1732 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1731 (store v_prenex_1729 .cse3 (select v_prenex_1731 .cse3)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1731) v_prenex_1732 v_prenex_1728) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1733) v_prenex_1734) v_prenex_1730) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1728 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1729) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1731) v_prenex_1732) .cse2 (select v_prenex_1728 .cse2)))))) (forall ((v_prenex_2190 Int) (v_prenex_2192 (Array Int Int)) (v_prenex_2193 (Array Int Int)) (v_prenex_2196 (Array Int Int)) (v_prenex_2191 (Array Int Int)) (v_prenex_2194 Int) (v_prenex_2195 Int)) (let ((.cse68 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2193) v_prenex_2195 v_prenex_2191) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2196))) (or (< v_prenex_2194 0) (not (= v_prenex_2191 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2192) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2193) v_prenex_2195) .cse2 (select v_prenex_2191 .cse2)))) (= (select (select .cse68 v_prenex_2190) v_prenex_2194) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2194) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2194) (= (select (select .cse68 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2194) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store v_prenex_2192 .cse3 (select v_prenex_2193 .cse3)) v_prenex_2193)) (= v_prenex_2194 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_prenex_1714 (Array Int Int)) (v_prenex_1711 Int) (v_prenex_1709 (Array Int Int)) (v_prenex_1710 (Array Int Int)) (v_prenex_1715 Int) (v_prenex_1712 (Array Int Int)) (v_prenex_1713 Int)) (let ((.cse69 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1712) v_prenex_1713 v_prenex_1709) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1714))) (or (= v_prenex_1711 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (store v_prenex_1710 .cse3 (select v_prenex_1712 .cse3)) v_prenex_1712)) (= (select (select .cse69 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1711) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse69 v_prenex_1715) v_prenex_1711)) (not (= v_prenex_1709 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1710) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1712) v_prenex_1713) .cse2 (select v_prenex_1709 .cse2)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1711) (< v_prenex_1711 0) (= v_prenex_1713 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or (forall ((v_prenex_1742 Int) (v_prenex_1739 (Array Int Int)) (v_prenex_1740 Int) (v_prenex_1741 (Array Int Int))) (or (= v_prenex_1740 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1740) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1740) (< v_prenex_1740 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1739) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1741) v_prenex_1742) v_prenex_1740) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse21) (or .cse18 (forall ((v_prenex_1723 Int) (v_prenex_1721 Int) (v_prenex_1720 (Array Int Int)) (v_prenex_1722 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1721) (= v_prenex_1721 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1721 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1720) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1722) v_prenex_1723) v_prenex_1721) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1721)))) (or (forall ((v_prenex_1703 (Array Int Int)) (v_prenex_1700 Int) (v_prenex_1699 (Array Int Int)) (v_prenex_1698 (Array Int Int)) (v_prenex_1704 Int) (v_prenex_1701 (Array Int Int)) (v_prenex_1702 Int)) (let ((.cse70 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1701) v_prenex_1702 v_prenex_1698) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1703))) (or (= v_prenex_1700 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1701 (store v_prenex_1699 .cse3 (select v_prenex_1701 .cse3)))) (< v_prenex_1700 0) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1699) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1701) v_prenex_1702) .cse2 (select v_prenex_1698 .cse2)) v_prenex_1698)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1700) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse70 v_prenex_1704) v_prenex_1700)) (= (select (select .cse70 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1700) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse6) (or (forall ((v_prenex_1744 Int) (v_prenex_1743 (Array Int Int)) (v_prenex_1745 (Array Int Int)) (v_prenex_1746 Int)) (or (= (select v_prenex_1745 v_prenex_1744) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1744 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1744) (< v_prenex_1744 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1744) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1743) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1745) v_prenex_1746) v_prenex_1744)))) .cse21) (or (and (or (forall ((v_prenex_1689 Int) (v_prenex_1687 Int) (v_prenex_1686 (Array Int Int)) (v_prenex_1688 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1687) (= v_prenex_1687 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1687 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1686) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1688) v_prenex_1689) v_prenex_1687) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse18) (or (forall ((v_prenex_1685 Int) (v_prenex_1682 (Array Int Int)) (v_prenex_1683 Int) (v_prenex_1684 (Array Int Int))) (or (= v_prenex_1683 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1682) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1684) v_prenex_1685) v_prenex_1683)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1683) (< v_prenex_1683 0))) .cse21) (or (forall ((v_prenex_1727 (Array Int Int)) (v_prenex_1726 (Array Int Int)) (v_prenex_1725 Int) (v_prenex_1724 Int)) (or (= (select v_prenex_1727 v_prenex_1724) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1724 0) (= v_prenex_1724 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1724) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1726) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1727) v_prenex_1725) v_prenex_1724)))) .cse21) (or (forall ((v_prenex_1690 (Array Int Int)) (v_prenex_1692 (Array Int Int)) (v_prenex_1693 Int) (v_prenex_1691 Int)) (or (< v_prenex_1691 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1690) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1692) v_prenex_1693) v_prenex_1691)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1691) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1692 v_prenex_1691)) (= v_prenex_1691 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) .cse18)) .cse6) (or .cse6 (and (or (forall ((v_prenex_1735 (Array Int Int)) (v_prenex_1737 (Array Int Int)) (v_prenex_1738 Int) (v_prenex_1736 Int)) (or (< v_prenex_1736 0) (= v_prenex_1736 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1736) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1735) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1737) v_prenex_1738) v_prenex_1736) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse21) (or .cse18 (forall ((v_prenex_1697 Int) (v_prenex_1695 Int) (v_prenex_1694 (Array Int Int)) (v_prenex_1696 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1695) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1694) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1696) v_prenex_1697) v_prenex_1695)) (< v_prenex_1695 0) (= v_prenex_1695 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) (or (and (or (forall ((v_prenex_1679 Int) (v_prenex_1680 (Array Int Int)) (v_prenex_1681 Int) (v_prenex_1678 (Array Int Int))) (or (= v_prenex_1679 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1679) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1678) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1680) v_prenex_1681) v_prenex_1679) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1679 0) (= (select v_prenex_1680 v_prenex_1679) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse18) (or (forall ((v_prenex_1716 (Array Int Int)) (v_prenex_1718 (Array Int Int)) (v_prenex_1719 Int) (v_prenex_1717 Int)) (or (= v_prenex_1717 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_1717 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1717) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1716) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1718) v_prenex_1719) v_prenex_1717) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_1718 v_prenex_1717) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse21)) .cse6))) (or (and (forall ((v_prenex_1944 (Array Int Int)) (v_prenex_1946 (Array Int Int)) (v_prenex_1948 (Array Int Int)) (v_prenex_1949 Int) (v_prenex_1947 Int) (v_prenex_1943 (Array Int Int)) (v_prenex_1945 Int)) (let ((.cse71 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1946) v_prenex_1947 v_prenex_1943) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1948))) (or (not (= v_prenex_1943 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1944) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1946) v_prenex_1947) .cse2 (select v_prenex_1943 .cse2)))) (< v_prenex_1945 0) (= (select (select .cse71 v_prenex_1949) v_prenex_1945) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1947 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_1946 (store v_prenex_1944 .cse3 (select v_prenex_1946 .cse3)))) (= (select (select .cse71 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1945) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1945) (= v_prenex_1945 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or .cse25 (forall ((v_prenex_1942 Int) (v_prenex_1936 (Array Int Int)) (v_prenex_1940 Int) (v_prenex_1937 (Array Int Int)) (v_prenex_1939 (Array Int Int)) (v_prenex_1938 Int) (v_prenex_1941 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1939) v_prenex_1940 v_prenex_1936) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1941) v_prenex_1942) v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1937) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1939) v_prenex_1940) .cse2 (select v_prenex_1936 .cse2)) v_prenex_1936)) (= v_prenex_1940 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1938) (not (= v_prenex_1939 (store v_prenex_1937 .cse3 (select v_prenex_1939 .cse3)))) (= (select v_prenex_1941 v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1938 0) (= v_prenex_1938 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_prenex_2271 (Array Int Int)) (v_prenex_2272 (Array Int Int)) (v_prenex_2270 (Array Int Int)) (v_prenex_2266 Int) (v_prenex_2267 Int) (v_prenex_2268 Int) (v_prenex_2269 (Array Int Int))) (or (not (= v_prenex_2269 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2270) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2271) v_prenex_2267) .cse2 (select v_prenex_2269 .cse2)))) (< v_prenex_2266 0) (not (= v_prenex_2271 (store v_prenex_2270 .cse3 (select v_prenex_2271 .cse3)))) (= v_prenex_2266 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= v_prenex_2267 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2271) v_prenex_2267 v_prenex_2269) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2272) v_prenex_2268) v_prenex_2266)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2266)))) .cse7) (forall ((v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_arrayElimCell_143 Int) (v_ArrVal_2088 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_2085 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse73 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2085) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2094)) (.cse72 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2080))) (or (not (= (store (select (store .cse72 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2085) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse2 (select v_ArrVal_2088 .cse2)) v_ArrVal_2088)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_31) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse73 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_31)) (< v_prenex_31 0) (= v_arrayElimCell_143 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse73 v_arrayElimCell_143) v_prenex_31) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_2085 (store (select .cse72 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_2085 .cse3)))) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or (and (or (forall ((v_prenex_2165 (Array Int Int)) (v_prenex_2166 (Array Int Int)) (v_prenex_2164 (Array Int Int)) (v_prenex_2167 (Array Int Int)) (v_prenex_2161 Int) (v_prenex_2162 Int)) (or (not (= v_prenex_2164 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2165) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2166) v_prenex_2162) .cse2 (select v_prenex_2164 .cse2)))) (= v_prenex_2162 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2161) (< v_prenex_2161 0) (not (= v_prenex_2166 (store .cse4 .cse3 (select v_prenex_2166 .cse3)))) (= v_prenex_2161 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2166) v_prenex_2162 v_prenex_2164) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2167) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2161) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse5) (forall ((v_prenex_1658 (Array Int Int)) (v_prenex_1660 (Array Int Int)) (v_prenex_1661 Int) (v_prenex_1662 (Array Int Int)) (v_prenex_2163 Int) (v_prenex_1657 (Array Int Int)) (v_prenex_1659 Int)) (let ((.cse74 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1660) v_prenex_1661 v_prenex_1657) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1662)) (.cse75 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1658))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse74 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1659)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse74 v_prenex_2163) v_prenex_1659)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1659) (not (= v_prenex_1657 (store (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1660) v_prenex_1661) .cse2 (select v_prenex_1657 .cse2)))) (< v_prenex_1659 0) (not (= v_prenex_1660 (store (select .cse75 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_1660 .cse3)))) (= v_prenex_1659 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse6) (or .cse5 (and (forall ((v_prenex_2358 Int) (v_prenex_2360 (Array Int Int)) (v_prenex_2361 (Array Int Int)) (v_prenex_2362 (Array Int Int)) (v_prenex_2357 Int) (v_prenex_2359 (Array Int Int))) (or (not (= (store .cse4 .cse3 (select v_prenex_2361 .cse3)) v_prenex_2361)) (< v_prenex_2357 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2357) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2357) (= v_prenex_2358 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= v_prenex_2358 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2361) v_prenex_2358 v_prenex_2359) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2362) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2357)) (not (= v_prenex_2359 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2360) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2361) v_prenex_2358) .cse2 (select v_prenex_2359 .cse2)))) (= v_prenex_2357 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_prenex_2085 (Array Int Int)) (v_prenex_2088 (Array Int Int)) (v_prenex_2086 (Array Int Int)) (v_prenex_2087 Int) (v_prenex_2089 Int) (v_prenex_2090 (Array Int Int))) (or (not (= v_prenex_2088 (store .cse4 .cse3 (select v_prenex_2088 .cse3)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2087) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2087) (= v_prenex_2087 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= v_prenex_2089 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< v_prenex_2087 0) (not (= v_prenex_2085 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2086) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2088) v_prenex_2089) .cse2 (select v_prenex_2085 .cse2)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2088) v_prenex_2089 v_prenex_2085) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2090) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2087) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_2084 (Array Int Int)) (v_prenex_2082 (Array Int Int)) (v_prenex_2081 Int) (v_prenex_2079 (Array Int Int)) (v_prenex_2080 (Array Int Int)) (v_prenex_2083 Int)) (or (not (= v_prenex_2082 (store .cse4 .cse3 (select v_prenex_2082 .cse3)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2081) (< v_prenex_2081 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2082) v_prenex_2083 v_prenex_2079) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2084) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2081)) (= (select v_prenex_2084 v_prenex_2081) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2081 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_2079 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2080) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2082) v_prenex_2083) .cse2 (select v_prenex_2079 .cse2)))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2081) (= v_prenex_2083 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (or (forall ((v_prenex_2253 (Array Int Int)) (v_prenex_2256 Int) (v_prenex_2258 Int) (v_prenex_2252 (Array Int Int)) (v_prenex_2257 (Array Int Int)) (v_prenex_2255 (Array Int Int)) (v_prenex_2254 Int)) (let ((.cse76 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2257) v_prenex_2258 v_prenex_2255) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2252))) (or (= (select (select .cse76 v_prenex_2254) v_prenex_2256) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2256) (< v_prenex_2256 0) (= (select (select .cse76 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2256) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2254 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_2255 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2253) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2257) v_prenex_2258) .cse2 (select v_prenex_2255 .cse2)))) (not (= v_prenex_2257 (store .cse4 .cse3 (select v_prenex_2257 .cse3))))))) .cse5 .cse6) (or (and (forall ((v_prenex_1995 Int) (v_prenex_2322 Int) (v_prenex_1996 (Array Int Int)) (v_prenex_1997 (Array Int Int))) (let ((.cse77 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1996) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1997))) (or (< v_prenex_1995 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse77 v_prenex_2322) v_prenex_1995)) (= (select v_prenex_1997 v_prenex_1995) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1995) (= v_prenex_1995 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse77 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1995) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1995) (not (= v_prenex_1996 (store .cse4 .cse3 (select v_prenex_1996 .cse3))))))) (forall ((v_prenex_1998 Int) (v_prenex_1999 (Array Int Int)) (v_prenex_2000 (Array Int Int)) (v_prenex_2001 Int)) (let ((.cse78 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1999) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2000))) (or (= v_prenex_1998 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1999 (store .cse4 .cse3 (select v_prenex_1999 .cse3)))) (= (select (select .cse78 v_prenex_2001) v_prenex_1998) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse78 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1998) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1998) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1998) (< v_prenex_1998 0)))) (forall ((v_prenex_2321 Int) (v_prenex_2323 (Array Int Int)) (v_prenex_2324 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2323) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2324) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2321)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2321) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2321) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_2324 v_prenex_2321)) (= v_prenex_2321 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_2323 (store .cse4 .cse3 (select v_prenex_2323 .cse3)))) (< v_prenex_2321 0))) (forall ((v_prenex_2002 Int) (v_prenex_2004 (Array Int Int)) (v_prenex_2003 (Array Int Int))) (or (< v_prenex_2002 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2003) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2004) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2002) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2002) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2002) (not (= v_prenex_2003 (store .cse4 .cse3 (select v_prenex_2003 .cse3)))) (= v_prenex_2002 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse5) (or (forall ((v_prenex_2249 Int) (v_prenex_2250 (Array Int Int)) (v_prenex_2247 Int) (v_prenex_2251 Int) (v_prenex_2246 (Array Int Int)) (v_prenex_2245 (Array Int Int)) (v_prenex_2248 (Array Int Int))) (let ((.cse80 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2246)) (.cse79 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2248) v_prenex_2249 v_prenex_2245) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2250))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2247) (= (select (select .cse79 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2247) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_2250 v_prenex_2247) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select .cse80 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_2248 .cse3)) v_prenex_2248)) (not (= (store (select (store .cse80 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2248) v_prenex_2249) .cse2 (select v_prenex_2245 .cse2)) v_prenex_2245)) (< v_prenex_2247 0) (= v_prenex_2247 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse79 v_prenex_2251) v_prenex_2247))))) .cse6) (or (and (forall ((v_prenex_1984 Int) (v_prenex_1981 Int) (v_prenex_1983 (Array Int Int)) (v_prenex_1982 (Array Int Int))) (let ((.cse81 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1982) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1983))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1981) (= (select (select .cse81 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1981) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse81 v_prenex_1984) v_prenex_1981) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1981) (< v_prenex_1981 0) (= v_prenex_1981 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_prenex_2303 Int) (v_prenex_2300 Int) (v_prenex_2301 (Array Int Int)) (v_prenex_2302 (Array Int Int))) (or (= v_prenex_2300 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2301) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2302) v_prenex_2303) v_prenex_2300)) (= (select v_prenex_2302 v_prenex_2300) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2300) (< v_prenex_2300 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2300))) (forall ((v_prenex_1978 (Array Int Int)) (v_prenex_1979 (Array Int Int)) (v_prenex_1980 Int) (v_prenex_1977 Int)) (let ((.cse82 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1978) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1979))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1977) (= (select (select .cse82 v_prenex_1980) v_prenex_1977) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1977 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1977) (= v_prenex_1977 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse82 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1977)))))) .cse7) (forall ((v_prenex_2143 (Array Int Int)) (v_prenex_2146 Int) (v_prenex_2142 (Array Int Int)) (v_prenex_2148 Int) (v_prenex_2147 (Array Int Int)) (v_prenex_2145 (Array Int Int)) (v_prenex_2144 Int)) (let ((.cse83 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2143)) (.cse84 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2145) v_prenex_2146 v_prenex_2142) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2147))) (or (= v_prenex_2146 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_2142 (store (select (store .cse83 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2145) v_prenex_2146) .cse2 (select v_prenex_2142 .cse2)))) (= v_prenex_2144 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2144 0) (= v_prenex_2146 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse84 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2144)) (not (= v_prenex_2145 (store (select .cse83 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_2145 .cse3)))) (= (select (select .cse84 v_prenex_2148) v_prenex_2144) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2144)))) (forall ((v_prenex_2183 (Array Int Int)) (v_prenex_2184 (Array Int Int)) (v_prenex_2189 Int) (v_prenex_2188 (Array Int Int)) (v_prenex_2186 (Array Int Int)) (v_prenex_2185 Int) (v_prenex_2187 Int)) (let ((.cse85 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2184)) (.cse86 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2186) v_prenex_2187 v_prenex_2183) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2188))) (or (= v_prenex_2185 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_2186 (store (select .cse85 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_2186 .cse3)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2185) (not (= v_prenex_2183 (store (select (store .cse85 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2186) v_prenex_2187) .cse2 (select v_prenex_2183 .cse2)))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2185) (= (select (select .cse86 v_prenex_2189) v_prenex_2185) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2185 0) (= v_prenex_2187 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse86 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2185) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse6 (and (or .cse7 (and (forall ((v_prenex_1594 (Array Int Int)) (v_prenex_1596 (Array Int Int)) (v_prenex_1593 Int) (v_prenex_1595 (Array Int Int)) (v_prenex_2110 Int) (v_prenex_1592 Int) (v_prenex_1597 (Array Int Int))) (or (< v_prenex_1592 0) (not (= v_prenex_1594 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1596) v_prenex_1593) .cse2 (select v_prenex_1594 .cse2)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1596) v_prenex_1593 v_prenex_1594) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1597) v_prenex_2110) v_prenex_1592) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1592 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1592) (= v_prenex_1593 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (store v_prenex_1595 .cse3 (select v_prenex_1596 .cse3)) v_prenex_1596)))) (forall ((v_prenex_1589 Int) (v_prenex_1590 (Array Int Int)) (v_prenex_1587 Int) (v_prenex_1585 (Array Int Int)) (v_prenex_1591 Int) (v_prenex_1586 (Array Int Int)) (v_prenex_1588 (Array Int Int))) (let ((.cse87 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1588) v_prenex_1589 v_prenex_1585) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1590))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse87 v_prenex_1591) v_prenex_1587)) (< v_prenex_1587 0) (not (= (store v_prenex_1586 .cse3 (select v_prenex_1588 .cse3)) v_prenex_1588)) (= v_prenex_1589 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_1585 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1586) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1588) v_prenex_1589) .cse2 (select v_prenex_1585 .cse2)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1587) (= v_prenex_1587 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse87 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1587) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or .cse5 (and (forall ((v_prenex_72 (Array Int Int)) (v_prenex_2111 (Array Int Int)) (v_prenex_73 Int) (v_prenex_2112 (Array Int Int)) (v_prenex_2113 (Array Int Int)) (v_prenex_2109 Int)) (or (not (= v_prenex_2112 (store .cse4 .cse3 (select v_prenex_2112 .cse3)))) (= v_prenex_2109 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_73) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2111) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2112) v_prenex_73) .cse2 (select v_prenex_72 .cse2)) v_prenex_72)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2109) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2112) v_prenex_73 v_prenex_72) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2113) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2109) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2109 0))) (forall ((v_prenex_1580 (Array Int Int)) (v_prenex_1582 (Array Int Int)) (v_prenex_1583 Int) (v_prenex_1584 (Array Int Int)) (v_prenex_1581 Int) (v_prenex_1579 (Array Int Int))) (or (= (select v_prenex_1584 v_prenex_1581) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1581 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1581) (= v_prenex_1583 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1582) v_prenex_1583 v_prenex_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1584) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1581) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1579 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1580) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1582) v_prenex_1583) .cse2 (select v_prenex_1579 .cse2)))) (not (= v_prenex_1582 (store .cse4 .cse3 (select v_prenex_1582 .cse3)))) (= v_prenex_1581 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (forall ((v_prenex_1611 Int) (v_prenex_1606 (Array Int Int)) (v_prenex_1605 (Array Int Int)) (v_prenex_1608 (Array Int Int)) (v_prenex_1609 Int) (v_prenex_1607 Int) (v_prenex_1610 (Array Int Int))) (let ((.cse88 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1606)) (.cse89 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1608) v_prenex_1609 v_prenex_1605) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1610))) (or (< v_prenex_1607 0) (= v_prenex_1607 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select v_prenex_1610 v_prenex_1607) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1605 (store (select (store .cse88 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1608) v_prenex_1609) .cse2 (select v_prenex_1605 .cse2)))) (= (select (select .cse89 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1607) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1608 (store (select .cse88 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_1608 .cse3)))) (= (select (select .cse89 v_prenex_1611) v_prenex_1607) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1609 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1607)))) (forall ((v_prenex_1602 Int) (v_prenex_1603 (Array Int Int)) (v_prenex_1600 Int) (v_prenex_1598 (Array Int Int)) (v_prenex_1599 (Array Int Int)) (v_prenex_1604 Int) (v_prenex_1601 (Array Int Int))) (let ((.cse91 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1601) v_prenex_1602 v_prenex_1598) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1603)) (.cse90 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1599))) (or (not (= (store (select .cse90 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_1601 .cse3)) v_prenex_1601)) (= (select (select .cse91 v_prenex_1604) v_prenex_1600) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1600 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= v_prenex_1602 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse91 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1600) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1598 (store (select (store .cse90 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1601) v_prenex_1602) .cse2 (select v_prenex_1598 .cse2)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1600) (< v_prenex_1600 0)))))) (or (and (or (forall ((v_prenex_2102 Int) (v_prenex_2104 Int) (v_prenex_2103 (Array Int Int)) (v_prenex_2101 (Array Int Int))) (let ((.cse92 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2103) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2101))) (or (= (select (select .cse92 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2104) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_2103 (store .cse4 .cse2 (select v_prenex_2103 .cse2)))) (= (select (select .cse92 v_prenex_2102) v_prenex_2104) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2104 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2104)))) .cse21) (or (forall ((v_prenex_2099 (Array Int Int)) (v_prenex_2098 (Array Int Int)) (v_prenex_2100 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2100) (not (= (store .cse4 .cse2 (select v_prenex_2099 .cse2)) v_prenex_2099)) (< v_prenex_2100 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2099) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2098) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2100)))) .cse21) (or .cse18 (forall ((v_prenex_2106 Int) (v_prenex_2108 Int) (v_prenex_2107 (Array Int Int)) (v_prenex_2105 (Array Int Int))) (let ((.cse93 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2107) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2105))) (or (not (= v_prenex_2107 (store (store .cse4 .cse3 (select v_prenex_2107 .cse3)) .cse2 (select v_prenex_2107 .cse2)))) (< v_prenex_2108 0) (= (select (select .cse93 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2108) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse93 v_prenex_2106) v_prenex_2108) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2108))))) (or .cse6 (and (or (forall ((v_prenex_2095 (Array Int Int)) (v_prenex_2096 (Array Int Int)) (v_prenex_2366 Int) (v_prenex_2097 Int)) (let ((.cse94 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2096) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2095))) (or (not (= v_prenex_2096 (store (store .cse4 .cse3 (select v_prenex_2096 .cse3)) .cse2 (select v_prenex_2096 .cse2)))) (= v_prenex_2366 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2097) (< v_prenex_2097 0) (= (select (select .cse94 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2097) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse94 v_prenex_2366) v_prenex_2097))))) .cse18) (or .cse21 (forall ((v_prenex_2093 (Array Int Int)) (v_prenex_2092 Int) (v_prenex_2091 (Array Int Int)) (v_prenex_2094 Int)) (let ((.cse95 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2093) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2091))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2094) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse95 v_prenex_2092) v_prenex_2094)) (< v_prenex_2094 0) (= v_prenex_2092 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse95 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2094)) (not (= (store .cse4 .cse2 (select v_prenex_2093 .cse2)) v_prenex_2093)))))))) (or (forall ((v_prenex_2363 (Array Int Int)) (v_prenex_2365 (Array Int Int)) (v_prenex_2364 Int)) (or (not (= v_prenex_2363 (store (store .cse4 .cse3 (select v_prenex_2363 .cse3)) .cse2 (select v_prenex_2363 .cse2)))) (< v_prenex_2364 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2363) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2365) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2364) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2364))) .cse18)) .cse5) (forall ((v_prenex_2318 (Array Int Int)) (v_prenex_2319 (Array Int Int)) (v_prenex_2317 Int) (v_prenex_2320 Int) (v_prenex_2316 (Array Int Int))) (let ((.cse96 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2318) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2319))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse96 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2317)) (= (select (select .cse96 v_prenex_2320) v_prenex_2317) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2317 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2317) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2317) (= v_prenex_2317 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_2318 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2316) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_2318 .cse3))))))) (or (and (forall ((v_prenex_1648 (Array Int Int)) (v_prenex_1650 (Array Int Int)) (v_prenex_1649 Int) (v_prenex_1646 (Array Int Int)) (v_prenex_1645 (Array Int Int)) (v_prenex_1647 Int)) (or (= v_prenex_1649 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_1649 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1650 v_prenex_1647)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1648) v_prenex_1649 v_prenex_1645) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1650) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1647) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1647 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1645 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1646) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1648) v_prenex_1649) .cse2 (select v_prenex_1645 .cse2)))) (< v_prenex_1647 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1647) (not (= v_prenex_1648 (store .cse4 .cse3 (select v_prenex_1648 .cse3)))))) (forall ((v_prenex_2132 (Array Int Int)) (v_prenex_2133 (Array Int Int)) (v_prenex_2130 Int) (v_prenex_2131 Int) (v_prenex_2134 (Array Int Int)) (v_prenex_2135 (Array Int Int))) (or (= v_prenex_2130 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_2132 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2133) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2134) v_prenex_2131) .cse2 (select v_prenex_2132 .cse2)))) (< v_prenex_2130 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2134) v_prenex_2131 v_prenex_2132) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2135) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2130) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2130) (= v_prenex_2131 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2130) (= (select v_prenex_2135 v_prenex_2130) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_2134 (store .cse4 .cse3 (select v_prenex_2134 .cse3)))))) (or .cse6 (forall ((v_prenex_1639 (Array Int Int)) (v_prenex_1643 Int) (v_prenex_1641 Int) (v_prenex_1640 (Array Int Int)) (v_prenex_1642 (Array Int Int)) (v_prenex_1644 (Array Int Int))) (or (= (select v_prenex_1644 v_prenex_1641) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1641 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1642) v_prenex_1643 v_prenex_1639) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1644) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1641) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1641) (not (= v_prenex_1642 (store .cse4 .cse3 (select v_prenex_1642 .cse3)))) (< v_prenex_1641 0) (not (= v_prenex_1639 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1640) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1642) v_prenex_1643) .cse2 (select v_prenex_1639 .cse2)))) (= v_prenex_1643 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) .cse5)))) is different from false [2024-11-17 00:50:23,405 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:23,424 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:23,782 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:23,804 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:23,824 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:23,852 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:23,945 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:24,177 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:24,201 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,518 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,539 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,594 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,610 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,628 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,648 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,670 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,692 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,714 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,787 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,816 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:25,908 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:26,005 INFO L378 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 13 treesize of output 1 [2024-11-17 00:50:26,030 INFO L378 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 13 treesize of output 1