./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 22:42:40,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:42:40,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:42:40,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:42:40,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:42:40,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:42:40,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:42:40,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:42:40,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:42:40,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:42:40,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:42:40,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:42:40,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:42:40,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:42:40,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:42:40,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:42:40,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:42:40,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:42:40,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:42:40,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:42:40,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:42:40,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:42:40,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:42:40,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:42:40,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:42:40,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:42:40,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:42:40,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:42:40,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:42:40,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:42:40,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:42:40,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:42:40,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:42:40,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:42:40,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:42:40,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:42:40,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:42:40,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:42:40,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:42:40,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:42:40,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:42:40,693 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 22:42:40,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:42:40,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:42:40,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:42:40,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:42:40,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:42:40,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:42:40,731 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:42:40,732 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:42:40,732 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:42:40,732 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:42:40,733 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:42:40,733 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:42:40,734 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:42:40,734 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:42:40,734 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:42:40,734 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:42:40,735 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:42:40,735 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:42:40,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:42:40,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:42:40,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:42:40,736 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:42:40,736 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:42:40,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:42:40,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:42:40,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:42:40,738 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:42:40,738 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:42:40,738 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:42:40,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:42:40,739 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:42:40,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:42:40,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:42:40,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:42:40,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:42:40,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:42:40,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:42:40,740 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:42:40,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:42:40,741 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:42:40,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:42:40,741 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:42:40,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2022-11-25 22:42:41,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:42:41,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:42:41,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:42:41,083 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:42:41,083 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:42:41,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-11-25 22:42:44,163 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:42:44,465 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:42:44,466 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-11-25 22:42:44,480 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/data/6d79fa3b5/1e8325df6f3346c5910632224d7a2baa/FLAG31439e93d [2022-11-25 22:42:44,510 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/data/6d79fa3b5/1e8325df6f3346c5910632224d7a2baa [2022-11-25 22:42:44,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:42:44,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:42:44,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:42:44,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:42:44,528 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:42:44,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:42:44" (1/1) ... [2022-11-25 22:42:44,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f055e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:44, skipping insertion in model container [2022-11-25 22:42:44,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:42:44" (1/1) ... [2022-11-25 22:42:44,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:42:44,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:42:45,015 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2022-11-25 22:42:45,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:42:45,034 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:42:45,096 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2022-11-25 22:42:45,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:42:45,131 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:42:45,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45 WrapperNode [2022-11-25 22:42:45,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:42:45,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:42:45,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:42:45,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:42:45,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,208 INFO L138 Inliner]: procedures = 126, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-11-25 22:42:45,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:42:45,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:42:45,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:42:45,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:42:45,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,256 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:42:45,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:42:45,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:42:45,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:42:45,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (1/1) ... [2022-11-25 22:42:45,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:42:45,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:42:45,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:42:45,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:42:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-25 22:42:45,341 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-25 22:42:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 22:42:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:42:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:42:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:42:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:42:45,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:42:45,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:42:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 22:42:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:42:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:42:45,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:42:45,469 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:42:45,471 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:42:45,552 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-25 22:42:45,826 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:42:45,880 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:42:45,888 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 22:42:45,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:42:45 BoogieIcfgContainer [2022-11-25 22:42:45,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:42:45,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:42:45,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:42:45,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:42:45,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:42:44" (1/3) ... [2022-11-25 22:42:45,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6981fd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:42:45, skipping insertion in model container [2022-11-25 22:42:45,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:45" (2/3) ... [2022-11-25 22:42:45,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6981fd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:42:45, skipping insertion in model container [2022-11-25 22:42:45,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:42:45" (3/3) ... [2022-11-25 22:42:45,905 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2022-11-25 22:42:45,927 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:42:45,928 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-11-25 22:42:45,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:42:45,999 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1dcebf8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:42:46,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-25 22:42:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 25 states have (on average 2.24) internal successors, (56), 50 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:42:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 22:42:46,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:46,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 22:42:46,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:42:46,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash 4276196, now seen corresponding path program 1 times [2022-11-25 22:42:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:42:46,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047371405] [2022-11-25 22:42:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:46,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:42:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:46,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:42:46,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047371405] [2022-11-25 22:42:46,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047371405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:46,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:46,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:42:46,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952426646] [2022-11-25 22:42:46,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:46,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:42:46,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:42:46,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:42:46,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:46,374 INFO L87 Difference]: Start difference. First operand has 52 states, 25 states have (on average 2.24) internal successors, (56), 50 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 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) [2022-11-25 22:42:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:46,537 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-11-25 22:42:46,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:42:46,540 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 [2022-11-25 22:42:46,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:46,548 INFO L225 Difference]: With dead ends: 76 [2022-11-25 22:42:46,548 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 22:42:46,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:46,553 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 40 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:46,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 67 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:42:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 22:42:46,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 45. [2022-11-25 22:42:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 44 states have internal predecessors, (48), 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) [2022-11-25 22:42:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-11-25 22:42:46,589 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 4 [2022-11-25 22:42:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:46,589 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-11-25 22:42:46,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:42:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-11-25 22:42:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 22:42:46,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:46,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 22:42:46,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:42:46,591 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:42:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:46,592 INFO L85 PathProgramCache]: Analyzing trace with hash 4276197, now seen corresponding path program 1 times [2022-11-25 22:42:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:42:46,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214878824] [2022-11-25 22:42:46,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:46,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:42:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:46,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:42:46,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214878824] [2022-11-25 22:42:46,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214878824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:46,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:46,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:42:46,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724932852] [2022-11-25 22:42:46,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:46,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:42:46,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:42:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:42:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:46,696 INFO L87 Difference]: Start difference. First operand 45 states and 48 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) [2022-11-25 22:42:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:46,772 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-11-25 22:42:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:42:46,773 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 [2022-11-25 22:42:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:46,775 INFO L225 Difference]: With dead ends: 74 [2022-11-25 22:42:46,775 INFO L226 Difference]: Without dead ends: 74 [2022-11-25 22:42:46,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:46,777 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:46,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 71 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:42:46,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-25 22:42:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2022-11-25 22:42:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 41 states have internal predecessors, (45), 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) [2022-11-25 22:42:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-11-25 22:42:46,783 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2022-11-25 22:42:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:46,784 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-11-25 22:42:46,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:42:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-11-25 22:42:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 22:42:46,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:46,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 22:42:46,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:42:46,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:42:46,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 4376208, now seen corresponding path program 1 times [2022-11-25 22:42:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:42:46,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417329370] [2022-11-25 22:42:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:42:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:46,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:42:46,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417329370] [2022-11-25 22:42:46,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417329370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:46,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:46,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:42:46,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123632278] [2022-11-25 22:42:46,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:46,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:42:46,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:42:46,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:42:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:46,952 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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) [2022-11-25 22:42:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:46,975 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-11-25 22:42:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:42:46,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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 [2022-11-25 22:42:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:46,979 INFO L225 Difference]: With dead ends: 52 [2022-11-25 22:42:46,979 INFO L226 Difference]: Without dead ends: 52 [2022-11-25 22:42:46,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:46,982 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:46,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 76 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:42:46,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-25 22:42:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-11-25 22:42:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 42 states have internal predecessors, (46), 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) [2022-11-25 22:42:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-11-25 22:42:46,994 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 4 [2022-11-25 22:42:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:46,995 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-11-25 22:42:46,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 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) [2022-11-25 22:42:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-11-25 22:42:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:42:46,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:46,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:46,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 22:42:46,996 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:42:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2081771880, now seen corresponding path program 1 times [2022-11-25 22:42:46,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:42:46,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268028625] [2022-11-25 22:42:46,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:46,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:42:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:47,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:42:47,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268028625] [2022-11-25 22:42:47,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268028625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:47,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:47,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:42:47,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306896800] [2022-11-25 22:42:47,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:47,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:42:47,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:42:47,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:42:47,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:47,104 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-11-25 22:42:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:47,135 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-11-25 22:42:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:42:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-11-25 22:42:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:47,136 INFO L225 Difference]: With dead ends: 49 [2022-11-25 22:42:47,136 INFO L226 Difference]: Without dead ends: 49 [2022-11-25 22:42:47,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:47,138 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:47,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:42:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-25 22:42:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-11-25 22:42:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 47 states have internal predecessors, (51), 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) [2022-11-25 22:42:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-11-25 22:42:47,143 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 8 [2022-11-25 22:42:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:47,144 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-11-25 22:42:47,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-11-25 22:42:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-11-25 22:42:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:42:47,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:47,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:47,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 22:42:47,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:42:47,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1256794505, now seen corresponding path program 1 times [2022-11-25 22:42:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:42:47,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29012048] [2022-11-25 22:42:47,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:47,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:42:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:42:47,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:42:47,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29012048] [2022-11-25 22:42:47,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29012048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:47,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:47,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:42:47,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769399241] [2022-11-25 22:42:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:47,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:42:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:42:47,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:42:47,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:42:47,289 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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) [2022-11-25 22:42:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:47,319 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-11-25 22:42:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:42:47,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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 [2022-11-25 22:42:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:47,321 INFO L225 Difference]: With dead ends: 71 [2022-11-25 22:42:47,321 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 22:42:47,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:42:47,322 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 84 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:47,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 78 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:42:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 22:42:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2022-11-25 22:42:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 48 states have internal predecessors, (52), 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) [2022-11-25 22:42:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-11-25 22:42:47,337 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2022-11-25 22:42:47,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:47,337 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-11-25 22:42:47,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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) [2022-11-25 22:42:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-11-25 22:42:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:42:47,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:47,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:47,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 22:42:47,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:42:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1256796369, now seen corresponding path program 1 times [2022-11-25 22:42:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:42:47,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919382522] [2022-11-25 22:42:47,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:42:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:47,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:42:47,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919382522] [2022-11-25 22:42:47,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919382522] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:42:47,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404287490] [2022-11-25 22:42:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:47,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:42:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:42:47,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:42:47,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 22:42:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:47,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:42:47,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:47,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:47,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404287490] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:42:47,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1165289384] [2022-11-25 22:42:47,640 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-25 22:42:47,640 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:42:47,645 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:42:47,650 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:42:47,651 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:42:47,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:47,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:47,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 22:42:47,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:47,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:47,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:47,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:47,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:47,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 22:42:47,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:47,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:42:47,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:42:47,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:42:48,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:42:48,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:42:48,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:42:48,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:42:48,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:42:48,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:42:48,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-25 22:42:48,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:42:48,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:42:48,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:42:48,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:42:48,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:42:48,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:42:48,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:48,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:48,792 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 22:42:48,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-25 22:42:48,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:48,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:48,844 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 22:42:48,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-25 22:42:48,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:48,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:48,889 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 22:42:48,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 395 treesize of output 376 [2022-11-25 22:42:49,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-25 22:42:49,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:42:49,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:42:49,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:42:49,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:42:49,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:42:49,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:42:49,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:49,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:49,469 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 22:42:49,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 395 treesize of output 376 [2022-11-25 22:42:49,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:49,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:49,513 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 22:42:49,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-25 22:42:49,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:49,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:49,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:49,572 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-25 22:42:49,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-25 22:42:49,949 INFO L321 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-25 22:42:49,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 313 treesize of output 320 [2022-11-25 22:42:50,342 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-25 22:42:50,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 396 treesize of output 387 [2022-11-25 22:42:50,389 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-11-25 22:42:50,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 392 treesize of output 389 [2022-11-25 22:42:50,436 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-25 22:42:50,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 396 treesize of output 387 [2022-11-25 22:42:50,546 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:42:53,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1165289384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:53,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:42:53,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2022-11-25 22:42:53,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976235870] [2022-11-25 22:42:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:53,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:42:53,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:42:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:42:53,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-25 22:42:53,996 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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) [2022-11-25 22:42:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:55,105 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-11-25 22:42:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:42:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 [2022-11-25 22:42:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:55,106 INFO L225 Difference]: With dead ends: 60 [2022-11-25 22:42:55,106 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 22:42:55,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:42:55,107 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:55,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:42:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 22:42:55,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2022-11-25 22:42:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 55 states have internal predecessors, (60), 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) [2022-11-25 22:42:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-11-25 22:42:55,112 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 11 [2022-11-25 22:42:55,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:55,113 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-11-25 22:42:55,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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) [2022-11-25 22:42:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-11-25 22:42:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 22:42:55,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:55,114 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-25 22:42:55,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 22:42:55,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:42:55,323 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:42:55,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2029972017, now seen corresponding path program 1 times [2022-11-25 22:42:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:42:55,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468417784] [2022-11-25 22:42:55,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:42:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:55,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:42:55,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468417784] [2022-11-25 22:42:55,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468417784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:42:55,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825278439] [2022-11-25 22:42:55,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:42:55,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:42:55,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:42:55,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 22:42:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:55,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 22:42:55,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:55,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:42:55,800 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 22:42:55,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 22:42:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:55,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:55,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825278439] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:42:55,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1065901145] [2022-11-25 22:42:55,957 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 22:42:55,957 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:42:55,958 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:42:55,958 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:42:55,958 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:42:55,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:55,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:55,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 22:42:56,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 22:42:56,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:42:56,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:42:56,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:42:56,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:42:56,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:42:56,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:42:56,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:42:56,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:42:56,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:42:56,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 22:42:56,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:42:56,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:42:56,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:42:56,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:42:56,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:42:56,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:42:56,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:56,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:56,566 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:42:56,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-25 22:42:56,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:56,596 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 22:42:56,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-25 22:42:56,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:56,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:56,629 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:42:56,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-25 22:42:56,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 22:42:56,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:42:56,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:42:56,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:42:56,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:42:56,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:42:56,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:56,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:42:57,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:57,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:57,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:57,071 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:42:57,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-25 22:42:57,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:57,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:57,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:57,104 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 22:42:57,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-25 22:42:57,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:57,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:57,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:42:57,139 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:42:57,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-25 22:42:57,467 INFO L321 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-25 22:42:57,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 310 treesize of output 317 [2022-11-25 22:42:57,807 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 22:42:57,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 392 treesize of output 389 [2022-11-25 22:42:57,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:42:57,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 387 [2022-11-25 22:42:57,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:42:57,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 396 treesize of output 387 [2022-11-25 22:42:57,920 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:43:01,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1065901145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:01,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:43:01,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 3, 4] total 13 [2022-11-25 22:43:01,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68905560] [2022-11-25 22:43:01,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:01,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 22:43:01,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:43:01,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 22:43:01,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-25 22:43:01,599 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:02,429 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-25 22:43:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 22:43:02,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 22:43:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:02,431 INFO L225 Difference]: With dead ends: 58 [2022-11-25 22:43:02,431 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 22:43:02,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-25 22:43:02,432 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:02,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:43:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 22:43:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-11-25 22:43:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.605263157894737) internal successors, (61), 56 states have internal predecessors, (61), 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) [2022-11-25 22:43:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-11-25 22:43:02,436 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 15 [2022-11-25 22:43:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:02,437 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-11-25 22:43:02,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-11-25 22:43:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 22:43:02,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:02,438 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:02,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:02,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:02,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:43:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:02,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1373263003, now seen corresponding path program 1 times [2022-11-25 22:43:02,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:43:02,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517798192] [2022-11-25 22:43:02,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:02,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:43:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:43:02,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:43:02,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517798192] [2022-11-25 22:43:02,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517798192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:02,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150641139] [2022-11-25 22:43:02,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:02,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:02,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:43:02,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:43:02,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 22:43:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:03,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 22:43:03,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:03,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:03,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:43:03,059 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:43:03,060 INFO L350 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 [2022-11-25 22:43:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 22:43:03,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 22:43:03,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150641139] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:43:03,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [308402131] [2022-11-25 22:43:03,163 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-25 22:43:03,164 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:43:03,164 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:43:03,164 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:43:03,164 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:43:03,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 22:43:03,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 22:43:03,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:03,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:03,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:43:03,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:43:03,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:03,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:03,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:43:03,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:03,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 22:43:03,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:43:03,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:43:03,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:43:03,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:43:03,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:43:03,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:03,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:03,761 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 22:43:03,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-25 22:43:03,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:03,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:03,800 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:43:03,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-25 22:43:03,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:03,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:03,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:03,837 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:43:03,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-25 22:43:04,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:04,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:04,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:04,023 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-25 22:43:04,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 385 [2022-11-25 22:43:04,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:04,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:04,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:04,077 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-25 22:43:04,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 386 treesize of output 381 [2022-11-25 22:43:04,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:04,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:04,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:04,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:04,113 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-25 22:43:04,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 379 treesize of output 360 [2022-11-25 22:43:04,586 INFO L321 Elim1Store]: treesize reduction 184, result has 14.8 percent of original size [2022-11-25 22:43:04,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 596 treesize of output 590 [2022-11-25 22:43:04,814 INFO L321 Elim1Store]: treesize reduction 200, result has 14.5 percent of original size [2022-11-25 22:43:04,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 647 treesize of output 539 [2022-11-25 22:43:04,876 INFO L321 Elim1Store]: treesize reduction 200, result has 13.8 percent of original size [2022-11-25 22:43:04,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 647 treesize of output 617 [2022-11-25 22:43:04,942 INFO L321 Elim1Store]: treesize reduction 130, result has 17.7 percent of original size [2022-11-25 22:43:04,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 643 treesize of output 639 [2022-11-25 22:43:05,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,108 INFO L321 Elim1Store]: treesize reduction 200, result has 17.0 percent of original size [2022-11-25 22:43:05,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 548 [2022-11-25 22:43:05,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,195 INFO L321 Elim1Store]: treesize reduction 222, result has 16.9 percent of original size [2022-11-25 22:43:05,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 626 [2022-11-25 22:43:05,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:05,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:05,261 INFO L321 Elim1Store]: treesize reduction 125, result has 5.3 percent of original size [2022-11-25 22:43:05,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 658 treesize of output 642 [2022-11-25 22:43:05,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:05,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,404 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:43:05,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-25 22:43:05,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:05,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,450 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:43:05,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-25 22:43:05,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:05,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:05,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,479 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 22:43:05,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-25 22:43:05,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,649 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-25 22:43:05,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 385 [2022-11-25 22:43:05,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,700 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-25 22:43:05,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 386 treesize of output 381 [2022-11-25 22:43:05,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:05,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:05,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:05,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:05,738 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 22:43:05,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 379 treesize of output 360 [2022-11-25 22:43:06,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:43:06,104 INFO L350 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 6 treesize of output 5 [2022-11-25 22:43:06,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:43:06,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:06,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:06,153 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:43:10,305 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1143#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (= |ULTIMATE.start_dll_create_~head~0#1.offset| |ULTIMATE.start_dll_create_#res#1.offset|) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1)) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:43:10,305 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:43:10,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:43:10,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 7 [2022-11-25 22:43:10,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573225922] [2022-11-25 22:43:10,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:43:10,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 22:43:10,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:43:10,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 22:43:10,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-11-25 22:43:10,307 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:10,421 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-11-25 22:43:10,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:43:10,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 22:43:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:10,422 INFO L225 Difference]: With dead ends: 73 [2022-11-25 22:43:10,422 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 22:43:10,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-25 22:43:10,424 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 122 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:10,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 56 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:43:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 22:43:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2022-11-25 22:43:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 56 states have internal predecessors, (62), 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) [2022-11-25 22:43:10,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-25 22:43:10,437 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 19 [2022-11-25 22:43:10,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:10,438 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-25 22:43:10,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-25 22:43:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 22:43:10,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:10,439 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:10,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:10,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:10,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:43:10,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:10,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1373263004, now seen corresponding path program 1 times [2022-11-25 22:43:10,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:43:10,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214280555] [2022-11-25 22:43:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:10,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:43:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:43:11,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:43:11,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214280555] [2022-11-25 22:43:11,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214280555] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:11,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161672825] [2022-11-25 22:43:11,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:11,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:11,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:43:11,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:43:11,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 22:43:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:11,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 22:43:11,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:11,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:11,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:11,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:43:11,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:11,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:43:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:43:11,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:13,800 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| Int) (v_ArrVal_381 Int)) (or (forall ((v_ArrVal_382 Int)) (<= (+ |c_ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| v_ArrVal_381) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| v_ArrVal_382) |c_ULTIMATE.start_main_~#s~0#1.base|))) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)))))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2022-11-25 22:43:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 22:43:13,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161672825] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:43:13,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1026922027] [2022-11-25 22:43:13,804 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-25 22:43:13,805 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:43:13,805 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:43:13,805 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:43:13,805 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:43:13,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:13,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:13,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 22:43:13,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:13,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:13,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:13,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:13,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:13,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 22:43:13,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:13,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:43:13,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:13,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:14,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:14,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:14,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:43:14,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:14,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:14,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:43:14,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 22:43:14,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:43:14,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:43:14,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:43:14,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:43:14,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:43:14,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:14,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,531 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:43:14,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-25 22:43:14,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,567 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 22:43:14,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 371 [2022-11-25 22:43:14,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,603 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:43:14,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-25 22:43:14,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,799 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-25 22:43:14,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 393 treesize of output 388 [2022-11-25 22:43:14,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,842 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-25 22:43:14,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 389 treesize of output 384 [2022-11-25 22:43:14,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:14,876 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-25 22:43:14,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 382 treesize of output 363 [2022-11-25 22:43:15,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,251 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 22:43:15,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2022-11-25 22:43:15,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:43:15,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:43:15,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:43:15,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:43:15,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:43:15,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:15,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:15,526 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 22:43:15,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 371 [2022-11-25 22:43:15,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:15,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:15,561 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:43:15,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-25 22:43:15,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:15,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:15,596 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 22:43:15,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-25 22:43:15,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:15,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:15,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:15,776 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-25 22:43:15,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 393 treesize of output 388 [2022-11-25 22:43:15,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:15,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 384 [2022-11-25 22:43:15,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:15,840 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-25 22:43:15,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 382 treesize of output 363 [2022-11-25 22:43:16,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:43:16,237 INFO L350 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 6 treesize of output 5 [2022-11-25 22:43:16,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:43:16,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:16,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:16,282 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:43:20,367 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1407#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (not (<= (+ |ULTIMATE.start_dll_remove_first_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|))) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (= |ULTIMATE.start_dll_create_~head~0#1.offset| |ULTIMATE.start_dll_create_#res#1.offset|) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:43:20,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:43:20,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:43:20,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 10 [2022-11-25 22:43:20,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247889959] [2022-11-25 22:43:20,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:43:20,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 22:43:20,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:43:20,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 22:43:20,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=317, Unknown=1, NotChecked=38, Total=462 [2022-11-25 22:43:20,370 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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) [2022-11-25 22:43:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:20,527 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-11-25 22:43:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:43:20,527 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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 19 [2022-11-25 22:43:20,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:20,528 INFO L225 Difference]: With dead ends: 53 [2022-11-25 22:43:20,528 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 22:43:20,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=131, Invalid=378, Unknown=1, NotChecked=42, Total=552 [2022-11-25 22:43:20,529 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 200 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:20,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 22 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-11-25 22:43:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 22:43:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 22:43:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 52 states have internal predecessors, (57), 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) [2022-11-25 22:43:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-11-25 22:43:20,534 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 19 [2022-11-25 22:43:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:20,534 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-11-25 22:43:20,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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) [2022-11-25 22:43:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-11-25 22:43:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:43:20,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:20,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:20,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:20,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 22:43:20,746 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:43:20,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:20,746 INFO L85 PathProgramCache]: Analyzing trace with hash -378519837, now seen corresponding path program 1 times [2022-11-25 22:43:20,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:43:20,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221583359] [2022-11-25 22:43:20,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:43:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:43:20,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:43:20,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221583359] [2022-11-25 22:43:20,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221583359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:20,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:20,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:43:20,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071481296] [2022-11-25 22:43:20,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:20,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:43:20,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:43:20,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:43:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:43:20,913 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 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) [2022-11-25 22:43:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:21,099 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-11-25 22:43:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:43:21,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 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 20 [2022-11-25 22:43:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:21,100 INFO L225 Difference]: With dead ends: 73 [2022-11-25 22:43:21,100 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 22:43:21,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-25 22:43:21,101 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 84 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:21,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 72 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:43:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 22:43:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2022-11-25 22:43:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.45) internal successors, (58), 52 states have internal predecessors, (58), 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) [2022-11-25 22:43:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-25 22:43:21,105 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 20 [2022-11-25 22:43:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:21,105 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-25 22:43:21,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 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) [2022-11-25 22:43:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-25 22:43:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:43:21,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:21,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:21,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 22:43:21,106 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:43:21,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash -378519836, now seen corresponding path program 1 times [2022-11-25 22:43:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:43:21,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788039977] [2022-11-25 22:43:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:21,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:43:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:43:21,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:43:21,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788039977] [2022-11-25 22:43:21,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788039977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:43:21,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:43:21,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:43:21,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192415115] [2022-11-25 22:43:21,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:43:21,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:43:21,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:43:21,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:43:21,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:43:21,413 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-11-25 22:43:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:21,608 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-11-25 22:43:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:43:21,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 [2022-11-25 22:43:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:21,609 INFO L225 Difference]: With dead ends: 66 [2022-11-25 22:43:21,609 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 22:43:21,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-25 22:43:21,610 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 128 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:21,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 66 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:43:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 22:43:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2022-11-25 22:43:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 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) [2022-11-25 22:43:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-11-25 22:43:21,613 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 20 [2022-11-25 22:43:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:21,613 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-11-25 22:43:21,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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) [2022-11-25 22:43:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-11-25 22:43:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 22:43:21,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:21,614 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:21,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 22:43:21,614 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:43:21,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1314706967, now seen corresponding path program 1 times [2022-11-25 22:43:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:43:21,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871271821] [2022-11-25 22:43:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:43:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:43:22,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:43:22,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871271821] [2022-11-25 22:43:22,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871271821] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:22,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588220492] [2022-11-25 22:43:22,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:22,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:22,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:43:22,151 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:43:22,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 22:43:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:22,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 22:43:22,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:22,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:22,381 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:43:22,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 22:43:22,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:22,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:22,487 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:43:22,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-25 22:43:22,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-11-25 22:43:22,723 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-25 22:43:22,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2022-11-25 22:43:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:43:22,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:22,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-11-25 22:43:22,954 INFO L321 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-11-25 22:43:22,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-11-25 22:43:22,963 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_580))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-11-25 22:43:23,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:23,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2022-11-25 22:43:23,170 INFO L321 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2022-11-25 22:43:23,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2022-11-25 22:43:23,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:23,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 104 [2022-11-25 22:43:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 22:43:23,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588220492] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:43:23,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1057908850] [2022-11-25 22:43:23,334 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-25 22:43:23,334 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:43:23,335 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:43:23,335 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:43:23,335 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:43:23,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 22:43:23,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 22:43:23,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:43:23,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:23,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:23,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:23,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:43:23,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:23,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:23,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:23,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:43:23,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 22:43:23,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:43:23,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:43:23,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:43:23,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:23,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:43:23,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:43:23,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-25 22:43:23,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:23,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-25 22:43:23,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:23,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-25 22:43:23,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:23,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:23,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-25 22:43:24,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:24,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,345 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 22:43:24,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2022-11-25 22:43:24,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:43:24,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:43:24,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:43:24,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:43:24,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:43:24,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:24,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:43:24,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:43:24,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:24,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:43:24,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:24,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:43:24,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:43:24,853 INFO L350 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 6 treesize of output 5 [2022-11-25 22:43:24,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:24,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:24,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:43:24,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:24,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:43:24,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:24,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:43:24,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:24,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:25,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:25,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:43:25,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:25,030 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 22:43:25,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:43:25,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:25,057 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 22:43:25,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2022-11-25 22:43:25,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:43:25,136 INFO L350 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 6 treesize of output 5 [2022-11-25 22:43:25,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:25,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:25,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:43:25,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:25,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:25,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:25,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:43:25,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:25,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:25,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:43:25,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:25,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:25,274 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 22:43:25,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2022-11-25 22:43:25,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:25,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:43:25,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:25,313 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 22:43:25,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:43:25,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:43:25,472 INFO L350 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 6 treesize of output 5 [2022-11-25 22:43:25,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:25,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:43:25,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:25,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:25,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:25,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:25,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:25,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:25,597 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:43:25,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:43:25,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:25,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:25,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:25,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:25,699 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:43:25,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:43:25,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:25,774 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:43:29,667 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1961#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= (+ |ULTIMATE.start_dll_remove_first_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| |ULTIMATE.start_dll_create_#res#1.offset|) (not (= (select |#valid| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 1)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|))) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|) (<= 0 (+ |ULTIMATE.start_dll_create_~len#1| 1)) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4))) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (or (not (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|)) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0))) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:43:29,667 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:43:29,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:43:29,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 31 [2022-11-25 22:43:29,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102757230] [2022-11-25 22:43:29,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:43:29,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 22:43:29,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:43:29,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 22:43:29,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1693, Unknown=9, NotChecked=84, Total=1980 [2022-11-25 22:43:29,675 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 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) [2022-11-25 22:43:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:31,207 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-11-25 22:43:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 22:43:31,207 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 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 22 [2022-11-25 22:43:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:31,209 INFO L225 Difference]: With dead ends: 85 [2022-11-25 22:43:31,209 INFO L226 Difference]: Without dead ends: 85 [2022-11-25 22:43:31,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=411, Invalid=2664, Unknown=9, NotChecked=108, Total=3192 [2022-11-25 22:43:31,211 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 306 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:31,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 286 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 864 Invalid, 0 Unknown, 62 Unchecked, 0.7s Time] [2022-11-25 22:43:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-25 22:43:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2022-11-25 22:43:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 52 states have internal predecessors, (59), 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) [2022-11-25 22:43:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-11-25 22:43:31,216 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 22 [2022-11-25 22:43:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:31,216 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-11-25 22:43:31,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 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) [2022-11-25 22:43:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-11-25 22:43:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 22:43:31,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:31,218 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:31,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:31,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 22:43:31,424 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:43:31,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:31,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1314706968, now seen corresponding path program 1 times [2022-11-25 22:43:31,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:43:31,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82953344] [2022-11-25 22:43:31,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:43:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:43:32,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:43:32,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82953344] [2022-11-25 22:43:32,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82953344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:32,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475023071] [2022-11-25 22:43:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:32,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:32,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:43:32,432 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:43:32,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 22:43:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:32,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-25 22:43:32,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:32,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:43:32,694 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:43:32,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 22:43:32,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:32,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:32,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:32,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:32,915 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:43:32,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 60 [2022-11-25 22:43:32,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-11-25 22:43:33,288 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-25 22:43:33,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 70 [2022-11-25 22:43:33,320 INFO L321 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-11-25 22:43:33,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 45 [2022-11-25 22:43:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:43:33,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:34,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:34,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 265 treesize of output 329 [2022-11-25 22:43:35,204 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_687))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_686) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse0 .cse1) (+ .cse2 4)) 8)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6)) (.cse6 (select (select .cse7 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (+ 4 .cse6)) (.cse4 (select (select .cse3 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= 0 (select (select .cse3 .cse4) .cse5)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse6)) (< (select (select .cse7 .cse4) .cse5) .cse8) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4))))))) (forall ((v_prenex_4 Int) (v_prenex_6 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse12 (select (select .cse14 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse10 (select (select .cse11 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (+ 4 .cse10))) (let ((.cse9 (select (select .cse14 .cse12) .cse13))) (or (= 0 .cse9) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse10)) (< (select (select .cse11 .cse12) .cse13) .cse8) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse9))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse12)))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse16 (select (select .cse21 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse17 (select (select .cse18 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (+ .cse16 4))) (let ((.cse15 (select (select .cse21 .cse17) .cse19))) (or (= .cse15 0) (not (= .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse15 .cse8) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse17)) (= (select (select .cse18 .cse17) .cse19) (select (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse20 (select (select .cse20 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse24 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select .cse25 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (select (select .cse25 .cse24) (+ .cse23 4)))) (or (= .cse22 0) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse22 .cse8) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse24))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse27 (select (select .cse28 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse29 (select (select .cse32 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (+ 4 .cse27))) (let ((.cse26 (select (select .cse32 .cse29) .cse30))) (or (= 0 .cse26) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse27)) (< (select (select .cse28 .cse29) .cse30) .cse8) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse29)) (= (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse31 (select (select .cse31 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse26))))))) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse33 (select (select .cse33 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse36 (select (select .cse37 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select (select .cse37 .cse36) (+ 4 .cse35)))) (or (= 0 .cse34) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse35)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse34) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse36)))))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse41 (select (select .cse38 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse39 (select (select .cse44 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (+ .cse41 4))) (let ((.cse42 (select (select .cse44 .cse39) .cse40))) (or (= (select (select .cse38 .cse39) .cse40) 0) (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse42 (select (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse43 (select (select .cse43 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse39)) (= .cse42 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse47 (select (select .cse49 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse46 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse45 (select (select .cse49 .cse47) (+ 4 .cse46)))) (or (= 0 .cse45) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse46)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse45) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse47)) (= (select (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse48 (select (select .cse48 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse45)))))) (or (and (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse53 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse52 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse51 (select (select .cse52 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse50 (select (select .cse52 .cse53) (+ .cse51 4)))) (or (= .cse50 0) (not (= .cse51 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse50 .cse8)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse53))))) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse58 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse54 (select (select .cse58 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse54)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse57 (select (select .cse55 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse56 (+ .cse57 4))) (or (= (select (select .cse55 .cse54) .cse56) 0) (not (= .cse57 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select .cse58 .cse54) .cse56) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse59 (select (select .cse59 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse65 (select (let ((.cse67 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse67 (select (select .cse67 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse61 (select (select .cse62 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse63 (select (select .cse66 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse64 (+ 4 .cse61))) (let ((.cse60 (select (select .cse66 .cse63) .cse64))) (or (= 0 .cse60) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse61)) (< (select (select .cse62 .cse63) .cse64) .cse8) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse63)) (= .cse65 .cse60))))))) (= .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) is different from false [2022-11-25 22:43:35,948 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse70 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse70 0))) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse70 0)))) (and (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse2 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse1 (select (select .cse2 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse0 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse1 4))) (let ((.cse5 (select (select .cse9 .cse0) .cse3))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse1)) (< (select (select .cse2 .cse0) .cse3) .cse4) (= .cse5 0) (= .cse5 (select (let ((.cse6 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse6 (select (select .cse6 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse15 (select (let ((.cse17 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse17 (select (select .cse17 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse12 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse11 (select (select .cse12 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse10 (select (select .cse16 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse11 4))) (let ((.cse14 (select (select .cse16 .cse10) .cse13))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse10)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse11)) (< (select (select .cse12 .cse10) .cse13) .cse4) (= .cse14 0) (= .cse14 .cse15))))))) (= .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse21 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse18 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (select (select .cse21 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select (select .cse21 .cse18) (+ .cse20 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse18)) (= .cse19 0) (not (= .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse19 .cse4)))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse22 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_687))) (let ((.cse24 (select (select .cse22 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_686) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse22 .cse23) (+ .cse24 4)) 8)) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_6 (Array Int Int))) (let ((.cse30 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse25 (select (select .cse30 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse25)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse28 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse27 (select (select .cse28 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (+ .cse27 4))) (let ((.cse26 (select (select .cse30 .cse25) .cse29))) (or (= .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse27)) (< (select (select .cse28 .cse25) .cse29) .cse4) (= .cse26 0))))))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse37 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse33 (select (select .cse37 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse31 (select (select .cse35 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (+ .cse33 4))) (let ((.cse32 (select (select .cse37 .cse31) .cse36))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse31)) (= .cse32 0) (not (= .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse34 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse34 (select (select .cse34 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse35 .cse31) .cse36)) (< .cse32 .cse4))))))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse38 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse38 (select (select .cse38 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse40 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse39 (select (select .cse40 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse39)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse42 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse43 (select (select .cse42 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse41 (+ .cse43 4))) (or (= (select (select .cse40 .cse39) .cse41) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select .cse42 .cse39) .cse41) 0) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))))) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse44 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse44)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse47 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse46 (select (select .cse47 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse45 (select (select .cse47 .cse44) (+ .cse46 4)))) (or (= .cse45 0) (not (= .cse46 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse45 .cse4))))))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse52 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse48 (select (select .cse52 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse50 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse49 (select (select .cse52 .cse48) (+ .cse50 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse48)) (= .cse49 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse50)) (= .cse49 0) (= .cse49 (select (let ((.cse51 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse51 (select (select .cse51 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse55 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse54 (select (select .cse55 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse53 (select (select .cse57 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (+ .cse54 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse53)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse54)) (< (select (select .cse55 .cse53) .cse56) .cse4) (= (select (select .cse57 .cse53) .cse56) 0)))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse61 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse63 (select (select .cse61 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse64 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse59 (select (select .cse64 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse62 (+ .cse63 4))) (let ((.cse58 (select (select .cse64 .cse59) .cse62))) (or (= .cse58 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse59)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse60 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse60 (select (select .cse60 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse58)) (= (select (select .cse61 .cse59) .cse62) 0) (not (= .cse63 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse65 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse65 (select (select .cse65 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse69 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse66 (select (select .cse69 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse68 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse67 (select (select .cse69 .cse66) (+ .cse68 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse66)) (= .cse67 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse68)) (= .cse67 0)))))))))) is different from false [2022-11-25 22:43:36,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:36,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 131 [2022-11-25 22:43:36,486 INFO L321 Elim1Store]: treesize reduction 232, result has 36.8 percent of original size [2022-11-25 22:43:36,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 533 treesize of output 547 [2022-11-25 22:43:36,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:36,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 372 treesize of output 244 [2022-11-25 22:43:36,841 INFO L321 Elim1Store]: treesize reduction 204, result has 43.0 percent of original size [2022-11-25 22:43:36,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 872 treesize of output 897 [2022-11-25 22:43:36,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:36,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 813 treesize of output 767 [2022-11-25 22:43:37,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:37,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 566 treesize of output 552 [2022-11-25 22:43:37,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:37,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 369 treesize of output 365 [2022-11-25 22:43:39,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:39,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2022-11-25 22:43:39,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:39,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 60 [2022-11-25 22:43:39,668 INFO L321 Elim1Store]: treesize reduction 4, result has 90.2 percent of original size [2022-11-25 22:43:39,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 118 [2022-11-25 22:43:40,080 INFO L321 Elim1Store]: treesize reduction 232, result has 46.2 percent of original size [2022-11-25 22:43:40,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 322 treesize of output 440 [2022-11-25 22:43:40,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:40,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 325 treesize of output 317 [2022-11-25 22:43:40,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 128 [2022-11-25 22:43:42,705 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:43:42,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2022-11-25 22:43:42,726 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:43:42,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 465 treesize of output 1 [2022-11-25 22:43:42,739 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:43:42,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2022-11-25 22:43:42,753 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:43:42,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 1 [2022-11-25 22:43:42,766 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:43:42,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 240 treesize of output 1 [2022-11-25 22:43:42,779 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:43:42,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 381 treesize of output 1 [2022-11-25 22:43:42,791 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:43:42,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 242 treesize of output 1 [2022-11-25 22:43:42,803 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:43:42,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 1 [2022-11-25 22:43:42,814 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:43:42,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 1 [2022-11-25 22:43:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 22:43:43,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475023071] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:43:43,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [861195002] [2022-11-25 22:43:43,043 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-25 22:43:43,043 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:43:43,044 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:43:43,044 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:43:43,044 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:43:43,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 22:43:43,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 22:43:43,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:43:43,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:43,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:43,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:43,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:43:43,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:43,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:43,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:43,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:43:43,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-25 22:43:43,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:43:43,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:43:43,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:43:43,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:43:43,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:43:43,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:43,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:43,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:43:43,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:43:43,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:43:43,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:43:43,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:43,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:43,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-25 22:43:43,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:43:44,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:43:44,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:43:44,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:43:44,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:43:44,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:44,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:43:44,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:43:44,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:44,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:43:44,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:43:44,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:43:44,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:43:44,570 INFO L350 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 6 treesize of output 5 [2022-11-25 22:43:44,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:44,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:43:44,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:43:44,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:44,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:43:44,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:44,710 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:43:44,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:43:44,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:44,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:44,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:43:44,792 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:43:44,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:43:44,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:43:44,877 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:43:49,830 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2304#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= (+ |ULTIMATE.start_dll_remove_first_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| |ULTIMATE.start_dll_create_#res#1.offset|) (or (not (<= (+ 12 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|))) (not (<= 0 (+ 8 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|)))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|))) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4))) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (or (not (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|)) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0))) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:43:49,830 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:43:49,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:43:49,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2022-11-25 22:43:49,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703460467] [2022-11-25 22:43:49,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:43:49,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 22:43:49,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:43:49,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 22:43:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2134, Unknown=2, NotChecked=190, Total=2550 [2022-11-25 22:43:49,834 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:43:56,476 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse82 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse83 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse80 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse81 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse84 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse85 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse3 (<= .cse85 12)) (.cse1 (= .cse85 12)) (.cse0 (= (select .cse81 .cse84) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (select .cse5 .cse80)) (.cse26 (select .cse83 .cse84)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse11 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse83 .cse82 0))) (.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse81 .cse82 0))) (.cse25 (select .cse31 .cse80))) (and (or .cse0 (not .cse1)) .cse2 .cse3 (or (and .cse2 .cse3) .cse1) (not (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse5 .cse6) 0) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse9 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse8 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse7 (select (select .cse16 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (+ .cse8 4))) (let ((.cse12 (select (select .cse16 .cse7) .cse10))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse8)) (< (select (select .cse9 .cse7) .cse10) .cse11) (= .cse12 0) (= .cse12 (select (let ((.cse13 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse13 (select (select .cse13 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) .cse0 (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse22 (select (let ((.cse24 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse24 (select (select .cse24 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse19 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse18 (select (select .cse19 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse17 (select (select .cse23 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (+ .cse18 4))) (let ((.cse21 (select (select .cse23 .cse17) .cse20))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse17)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse18)) (< (select (select .cse19 .cse17) .cse20) .cse11) (= .cse21 0) (= .cse21 .cse22))))))) (= .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (<= (+ .cse25 12) (select |c_#length| .cse4)) (= .cse26 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse30 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse27 (select (select (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse29 (select (select .cse30 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse28 (select (select .cse30 .cse27) (+ .cse29 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse27)) (= .cse28 0) (not (= .cse29 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse28 .cse11)))))) (= (select |c_#length| (select .cse5 4)) 12) (= (select .cse31 4) 0) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse32 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_687))) (let ((.cse34 (select (select .cse32 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse33 (select (select (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_686) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse32 .cse33) (+ .cse34 4)) 8)) (not (= .cse34 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse26) (forall ((v_prenex_4 Int) (v_prenex_6 (Array Int Int))) (let ((.cse40 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse35 (select (select .cse40 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse35)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse38 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse37 (select (select .cse38 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse39 (+ .cse37 4))) (let ((.cse36 (select (select .cse40 .cse35) .cse39))) (or (= .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse37)) (< (select (select .cse38 .cse35) .cse39) .cse11) (= .cse36 0))))))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse47 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse43 (select (select .cse47 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse41 (select (select .cse45 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse46 (+ .cse43 4))) (let ((.cse42 (select (select .cse47 .cse41) .cse46))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse41)) (= .cse42 0) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse44 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse44 (select (select .cse44 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse45 .cse41) .cse46)) (< .cse42 .cse11))))))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse48 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse48 (select (select .cse48 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse50 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse49 (select (select .cse50 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse49)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse52 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse53 (select (select .cse52 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse51 (+ .cse53 4))) (or (= (select (select .cse50 .cse49) .cse51) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select .cse52 .cse49) .cse51) 0) (not (= .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))))) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse54 (select (select (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse54)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse57 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse56 (select (select .cse57 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse55 (select (select .cse57 .cse54) (+ .cse56 4)))) (or (= .cse55 0) (not (= .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse55 .cse11))))))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse62 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse58 (select (select .cse62 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse60 (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse59 (select (select .cse62 .cse58) (+ .cse60 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse58)) (= .cse59 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse60)) (= .cse59 0) (= .cse59 (select (let ((.cse61 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse61 (select (select .cse61 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) (= (select .cse31 .cse6) 0) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse65 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse64 (select (select .cse65 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse67 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse63 (select (select .cse67 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse66 (+ .cse64 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse63)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse64)) (< (select (select .cse65 .cse63) .cse66) .cse11) (= (select (select .cse67 .cse63) .cse66) 0)))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse71 (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse73 (select (select .cse71 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse74 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse69 (select (select .cse74 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse72 (+ .cse73 4))) (let ((.cse68 (select (select .cse74 .cse69) .cse72))) (or (= .cse68 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse69)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse70 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse70 (select (select .cse70 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse68)) (= (select (select .cse71 .cse69) .cse72) 0) (not (= .cse73 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse75 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse75 (select (select .cse75 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse79 (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse76 (select (select .cse79 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse78 (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse77 (select (select .cse79 .cse76) (+ .cse78 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse76)) (= .cse77 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse78)) (= .cse77 0))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= .cse25 0)))) is different from false [2022-11-25 22:44:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:07,550 INFO L93 Difference]: Finished difference Result 187 states and 198 transitions. [2022-11-25 22:44:07,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-25 22:44:07,559 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 22:44:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:07,560 INFO L225 Difference]: With dead ends: 187 [2022-11-25 22:44:07,560 INFO L226 Difference]: Without dead ends: 187 [2022-11-25 22:44:07,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=1056, Invalid=6749, Unknown=39, NotChecked=528, Total=8372 [2022-11-25 22:44:07,562 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 909 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:07,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 519 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 938 Invalid, 0 Unknown, 259 Unchecked, 2.1s Time] [2022-11-25 22:44:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-25 22:44:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 53. [2022-11-25 22:44:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 52 states have internal predecessors, (58), 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) [2022-11-25 22:44:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-25 22:44:07,566 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 22 [2022-11-25 22:44:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:07,567 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-25 22:44:07,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:44:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-25 22:44:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 22:44:07,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:07,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:07,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:07,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 22:44:07,780 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:44:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2101215349, now seen corresponding path program 1 times [2022-11-25 22:44:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:44:07,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73939171] [2022-11-25 22:44:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:44:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:44:07,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:44:07,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73939171] [2022-11-25 22:44:07,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73939171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:07,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:07,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:44:07,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147609159] [2022-11-25 22:44:07,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:07,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:44:07,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:44:07,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:44:07,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:44:07,939 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:44:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:08,077 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-25 22:44:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:44:08,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 22:44:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:08,079 INFO L225 Difference]: With dead ends: 61 [2022-11-25 22:44:08,079 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 22:44:08,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:44:08,080 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 121 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:08,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 73 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:44:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 22:44:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-11-25 22:44:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 54 states have internal predecessors, (60), 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) [2022-11-25 22:44:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-11-25 22:44:08,083 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 23 [2022-11-25 22:44:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:08,083 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-11-25 22:44:08,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:44:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-11-25 22:44:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 22:44:08,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:08,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:08,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 22:44:08,084 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:44:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash 713166488, now seen corresponding path program 1 times [2022-11-25 22:44:08,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:44:08,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236562872] [2022-11-25 22:44:08,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:44:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:44:08,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:44:08,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236562872] [2022-11-25 22:44:08,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236562872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:08,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:08,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:44:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437221356] [2022-11-25 22:44:08,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:08,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:44:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:44:08,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:44:08,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:44:08,247 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-11-25 22:44:08,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:08,439 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-11-25 22:44:08,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:44:08,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2022-11-25 22:44:08,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:08,440 INFO L225 Difference]: With dead ends: 62 [2022-11-25 22:44:08,440 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 22:44:08,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:44:08,441 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:08,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 56 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:44:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 22:44:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2022-11-25 22:44:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 57 states have internal predecessors, (63), 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) [2022-11-25 22:44:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-25 22:44:08,445 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 24 [2022-11-25 22:44:08,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:08,446 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-25 22:44:08,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-11-25 22:44:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-25 22:44:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 22:44:08,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:08,447 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:08,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 22:44:08,448 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:44:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash 628524500, now seen corresponding path program 1 times [2022-11-25 22:44:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:44:08,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863137151] [2022-11-25 22:44:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:08,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:44:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:44:08,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:44:08,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863137151] [2022-11-25 22:44:08,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863137151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:08,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:08,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 22:44:08,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349035145] [2022-11-25 22:44:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:08,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 22:44:08,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:44:08,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 22:44:08,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:44:08,920 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:44:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:09,173 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-11-25 22:44:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:44:09,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 22:44:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:09,190 INFO L225 Difference]: With dead ends: 63 [2022-11-25 22:44:09,190 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 22:44:09,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-25 22:44:09,191 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 149 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:09,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 76 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:44:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 22:44:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2022-11-25 22:44:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 55 states have internal predecessors, (61), 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) [2022-11-25 22:44:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-11-25 22:44:09,194 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 25 [2022-11-25 22:44:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:09,194 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-11-25 22:44:09,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:44:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-11-25 22:44:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 22:44:09,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:09,195 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:09,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 22:44:09,196 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:44:09,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:09,197 INFO L85 PathProgramCache]: Analyzing trace with hash 633324759, now seen corresponding path program 1 times [2022-11-25 22:44:09,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:44:09,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82639158] [2022-11-25 22:44:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:09,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:44:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 22:44:09,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:44:09,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82639158] [2022-11-25 22:44:09,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82639158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:09,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:09,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:44:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871508345] [2022-11-25 22:44:09,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:09,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:44:09,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:44:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:44:09,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:44:09,275 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-11-25 22:44:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:09,358 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-25 22:44:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:44:09,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 25 [2022-11-25 22:44:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:09,360 INFO L225 Difference]: With dead ends: 65 [2022-11-25 22:44:09,360 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 22:44:09,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:44:09,361 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:09,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 62 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:44:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 22:44:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-11-25 22:44:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 62 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:44:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-11-25 22:44:09,363 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 25 [2022-11-25 22:44:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:09,364 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-11-25 22:44:09,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-11-25 22:44:09,364 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-11-25 22:44:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 22:44:09,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:09,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:09,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 22:44:09,366 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:44:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1990576869, now seen corresponding path program 1 times [2022-11-25 22:44:09,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:44:09,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640432006] [2022-11-25 22:44:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:44:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:44:09,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:44:09,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640432006] [2022-11-25 22:44:09,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640432006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:09,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:09,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 22:44:09,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739312748] [2022-11-25 22:44:09,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:09,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 22:44:09,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:44:09,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 22:44:09,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:44:09,680 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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) [2022-11-25 22:44:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:10,018 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-11-25 22:44:10,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:44:10,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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 26 [2022-11-25 22:44:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:10,019 INFO L225 Difference]: With dead ends: 66 [2022-11-25 22:44:10,019 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 22:44:10,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-25 22:44:10,021 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:10,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 90 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:44:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 22:44:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-11-25 22:44:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 59 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) [2022-11-25 22:44:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-11-25 22:44:10,025 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 26 [2022-11-25 22:44:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:10,026 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-11-25 22:44:10,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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) [2022-11-25 22:44:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-11-25 22:44:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 22:44:10,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:10,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:10,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 22:44:10,030 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:44:10,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:10,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1841768837, now seen corresponding path program 1 times [2022-11-25 22:44:10,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:44:10,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085834220] [2022-11-25 22:44:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:10,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:44:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:44:10,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:44:10,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085834220] [2022-11-25 22:44:10,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085834220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:44:10,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737204979] [2022-11-25 22:44:10,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:10,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:44:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:44:10,282 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:44:10,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 22:44:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:10,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:44:10,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:10,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:10,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:44:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 22:44:10,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:44:10,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737204979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:10,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 22:44:10,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-25 22:44:10,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619189205] [2022-11-25 22:44:10,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:10,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:44:10,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:44:10,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:44:10,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-25 22:44:10,577 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-11-25 22:44:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:10,682 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-11-25 22:44:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:44:10,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 26 [2022-11-25 22:44:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:10,683 INFO L225 Difference]: With dead ends: 59 [2022-11-25 22:44:10,683 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 22:44:10,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-25 22:44:10,684 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:10,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 42 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:44:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 22:44:10,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 22:44:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.375) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:44:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-25 22:44:10,686 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 26 [2022-11-25 22:44:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:10,686 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-25 22:44:10,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2022-11-25 22:44:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-25 22:44:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 22:44:10,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:10,687 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:10,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:10,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:44:10,894 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:44:10,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash -413296800, now seen corresponding path program 1 times [2022-11-25 22:44:10,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:44:10,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452731188] [2022-11-25 22:44:10,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:44:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 22:44:10,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:44:10,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452731188] [2022-11-25 22:44:10,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452731188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:44:10,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:44:10,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:44:10,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781758251] [2022-11-25 22:44:10,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:44:10,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:44:10,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:44:10,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:44:10,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:44:10,980 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-11-25 22:44:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:11,027 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-11-25 22:44:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:44:11,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 28 [2022-11-25 22:44:11,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:11,028 INFO L225 Difference]: With dead ends: 57 [2022-11-25 22:44:11,028 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 22:44:11,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:44:11,029 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:11,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 20 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:44:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 22:44:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-25 22:44:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 56 states have internal predecessors, (64), 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) [2022-11-25 22:44:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-11-25 22:44:11,037 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 28 [2022-11-25 22:44:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:11,037 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-11-25 22:44:11,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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) [2022-11-25 22:44:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-11-25 22:44:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 22:44:11,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:11,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:11,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 22:44:11,040 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:44:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash 72643334, now seen corresponding path program 1 times [2022-11-25 22:44:11,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:44:11,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963266207] [2022-11-25 22:44:11,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:11,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:44:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:44:11,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:44:11,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963266207] [2022-11-25 22:44:11,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963266207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:44:11,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438236464] [2022-11-25 22:44:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:11,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:44:11,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:44:11,803 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:44:11,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 22:44:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:11,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-25 22:44:11,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:11,993 INFO L350 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 6 treesize of output 5 [2022-11-25 22:44:12,094 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:44:12,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 22:44:12,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:12,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 22:44:12,274 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:44:12,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-25 22:44:12,544 INFO L321 Elim1Store]: treesize reduction 4, result has 88.6 percent of original size [2022-11-25 22:44:12,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 48 [2022-11-25 22:44:12,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-25 22:44:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:44:12,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:12,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-25 22:44:13,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:13,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 50 [2022-11-25 22:44:13,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:13,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 154 [2022-11-25 22:44:13,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:13,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 103 [2022-11-25 22:44:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:44:13,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438236464] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:44:13,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1859987227] [2022-11-25 22:44:13,855 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-25 22:44:13,855 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:44:13,855 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:44:13,856 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:44:13,856 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:44:13,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:13,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:13,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 22:44:13,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:13,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:13,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:13,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:13,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:13,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 22:44:13,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:13,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:13,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:44:13,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:13,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:13,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:13,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:44:13,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:14,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:14,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:14,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:44:14,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:14,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-25 22:44:14,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:44:14,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:44:14,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:44:14,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:14,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:44:14,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:44:14,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:44:14,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:14,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:44:14,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:44:14,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:44:14,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:14,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,701 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-25 22:44:14,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2022-11-25 22:44:14,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:44:14,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:44:14,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:44:14,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:44:14,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:14,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:44:14,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:14,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:44:14,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:14,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:44:15,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:44:15,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:44:15,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:15,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:44:15,127 INFO L350 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 6 treesize of output 5 [2022-11-25 22:44:15,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:15,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:44:15,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:15,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:15,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:44:15,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:15,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:15,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:15,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:44:15,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:15,259 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 22:44:15,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2022-11-25 22:44:15,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:44:15,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:15,296 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 22:44:15,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:44:15,357 INFO L350 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 6 treesize of output 5 [2022-11-25 22:44:15,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:44:15,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:44:15,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:15,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:15,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:15,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:44:15,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:15,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:15,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:15,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:44:15,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:15,509 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 22:44:15,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2022-11-25 22:44:15,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:44:15,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:15,554 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 22:44:15,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:44:15,761 INFO L321 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2022-11-25 22:44:15,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-11-25 22:44:15,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:15,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2022-11-25 22:44:15,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:15,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:15,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 50 [2022-11-25 22:44:16,073 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-25 22:44:16,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 77 [2022-11-25 22:44:16,191 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-25 22:44:16,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 117 [2022-11-25 22:44:16,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:16,240 INFO L321 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2022-11-25 22:44:16,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 79 [2022-11-25 22:44:16,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:16,827 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-25 22:44:16,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 77 [2022-11-25 22:44:16,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:16,967 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-25 22:44:16,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 117 [2022-11-25 22:44:16,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:17,016 INFO L321 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2022-11-25 22:44:17,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 79 [2022-11-25 22:44:17,341 INFO L350 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 6 treesize of output 5 [2022-11-25 22:44:17,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:44:17,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:17,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:17,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:44:17,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:17,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:17,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:17,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:17,483 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:44:17,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:44:17,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:17,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:17,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:17,543 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:44:17,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:44:17,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:17,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:17,640 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:44:23,033 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3870#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_remove_first_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_remove_first_#t~mem6#1.base|) 1)) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_dll_remove_first_~head#1.base|) (<= 0 |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (<= 0 |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= |ULTIMATE.start_dll_remove_first_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_create_~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_create_~len#1| 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_remove_first_~head#1.offset|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-25 22:44:23,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:44:23,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:44:23,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 36 [2022-11-25 22:44:23,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051429816] [2022-11-25 22:44:23,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:44:23,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 22:44:23,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:44:23,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 22:44:23,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2482, Unknown=20, NotChecked=0, Total=2756 [2022-11-25 22:44:23,036 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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) [2022-11-25 22:44:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:24,403 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-11-25 22:44:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 22:44:24,404 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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 29 [2022-11-25 22:44:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:24,405 INFO L225 Difference]: With dead ends: 62 [2022-11-25 22:44:24,405 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 22:44:24,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=553, Invalid=3848, Unknown=21, NotChecked=0, Total=4422 [2022-11-25 22:44:24,409 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 152 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:24,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 266 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:44:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 22:44:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-11-25 22:44:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.302325581395349) internal successors, (56), 51 states have internal predecessors, (56), 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) [2022-11-25 22:44:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-11-25 22:44:24,416 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 29 [2022-11-25 22:44:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:24,416 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-11-25 22:44:24,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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) [2022-11-25 22:44:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-11-25 22:44:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 22:44:24,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:24,421 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:24,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:24,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:44:24,624 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:44:24,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:24,624 INFO L85 PathProgramCache]: Analyzing trace with hash 955588938, now seen corresponding path program 1 times [2022-11-25 22:44:24,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:44:24,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174772750] [2022-11-25 22:44:24,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:24,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:44:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:44:25,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:44:25,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174772750] [2022-11-25 22:44:25,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174772750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:44:25,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398007703] [2022-11-25 22:44:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:25,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:44:25,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:44:25,698 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:44:25,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 22:44:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:25,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-25 22:44:25,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:25,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:44:26,053 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:44:26,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 22:44:26,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:26,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:26,168 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:44:26,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-25 22:44:26,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-25 22:44:26,559 INFO L321 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-11-25 22:44:26,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 50 [2022-11-25 22:44:26,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-11-25 22:44:26,954 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 22:44:26,955 INFO L350 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 16 treesize of output 26 [2022-11-25 22:44:27,164 INFO L321 Elim1Store]: treesize reduction 62, result has 47.9 percent of original size [2022-11-25 22:44:27,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 101 [2022-11-25 22:44:30,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:30,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 140 treesize of output 200 [2022-11-25 22:44:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:44:30,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:31,015 INFO L321 Elim1Store]: treesize reduction 13, result has 78.7 percent of original size [2022-11-25 22:44:31,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 99 [2022-11-25 22:44:31,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2022-11-25 22:44:32,008 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1336 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1340 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1336)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1338))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select (select (store .cse1 .cse2 v_ArrVal_1340) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2)) (= .cse2 |ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-11-25 22:44:32,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:32,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 97 [2022-11-25 22:44:32,065 INFO L321 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2022-11-25 22:44:32,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 855 treesize of output 553 [2022-11-25 22:44:32,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 424 [2022-11-25 22:44:32,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:32,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 494 treesize of output 420 [2022-11-25 22:44:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 22:44:32,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398007703] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:44:32,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [98889357] [2022-11-25 22:44:32,349 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-25 22:44:32,349 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:44:32,350 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:44:32,350 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:44:32,350 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:44:32,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 22:44:32,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 22:44:32,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:44:32,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:32,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:32,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:32,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:44:32,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:32,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:44:32,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:32,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:32,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 22:44:32,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:44:32,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:44:32,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:44:32,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:44:32,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:32,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:44:32,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:32,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-25 22:44:32,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-25 22:44:32,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:32,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-25 22:44:32,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:32,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:32,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:32,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-25 22:44:33,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-25 22:44:33,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:44:33,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:44:33,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:44:33,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:33,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:44:33,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:44:33,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:44:33,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:33,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:44:33,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:44:33,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:44:33,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:44:33,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:33,885 INFO L321 Elim1Store]: treesize reduction 46, result has 49.5 percent of original size [2022-11-25 22:44:33,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 92 [2022-11-25 22:44:33,941 INFO L321 Elim1Store]: treesize reduction 58, result has 30.1 percent of original size [2022-11-25 22:44:33,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 76 [2022-11-25 22:44:33,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:44:34,297 INFO L321 Elim1Store]: treesize reduction 14, result has 65.0 percent of original size [2022-11-25 22:44:34,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2022-11-25 22:44:34,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:34,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 22:44:34,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-25 22:44:35,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:35,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:35,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:44:35,495 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-25 22:44:35,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 77 [2022-11-25 22:44:35,568 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-25 22:44:35,568 INFO L350 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 2 case distinctions, treesize of input 50 treesize of output 61 [2022-11-25 22:44:35,624 INFO L321 Elim1Store]: treesize reduction 35, result has 35.2 percent of original size [2022-11-25 22:44:35,624 INFO L350 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 2 case distinctions, treesize of input 28 treesize of output 33 [2022-11-25 22:44:35,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:36,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:36,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:36,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:44:36,554 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-25 22:44:36,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 77 [2022-11-25 22:44:36,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:36,617 INFO L321 Elim1Store]: treesize reduction 35, result has 35.2 percent of original size [2022-11-25 22:44:36,617 INFO L350 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 2 case distinctions, treesize of input 28 treesize of output 33 [2022-11-25 22:44:36,677 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-25 22:44:36,678 INFO L350 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 2 case distinctions, treesize of input 50 treesize of output 61 [2022-11-25 22:44:37,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:44:37,017 INFO L350 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 6 treesize of output 5 [2022-11-25 22:44:37,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:44:37,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:37,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:44:37,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:37,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:37,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:37,117 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:44:37,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:44:37,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:37,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:37,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:37,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:37,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:37,226 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:44:37,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:44:37,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:37,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:37,305 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:44:43,342 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4254#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_remove_first_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_remove_first_#t~mem6#1.base|) 1)) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_dll_remove_first_~head#1.base|) (<= 0 |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (<= 0 |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= |ULTIMATE.start_dll_remove_first_#in~head#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_dll_create_~data#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= 0 |ULTIMATE.start_dll_remove_first_~head#1.offset|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))' at error location [2022-11-25 22:44:43,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:44:43,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:44:43,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 50 [2022-11-25 22:44:43,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802126295] [2022-11-25 22:44:43,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:44:43,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-25 22:44:43,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:44:43,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-25 22:44:43,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=4077, Unknown=38, NotChecked=130, Total=4556 [2022-11-25 22:44:43,345 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 51 states, 50 states have (on average 1.76) internal successors, (88), 51 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) [2022-11-25 22:44:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:47,060 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-11-25 22:44:47,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 22:44:47,060 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.76) internal successors, (88), 51 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-25 22:44:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:47,061 INFO L225 Difference]: With dead ends: 81 [2022-11-25 22:44:47,061 INFO L226 Difference]: Without dead ends: 81 [2022-11-25 22:44:47,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=596, Invalid=6012, Unknown=38, NotChecked=160, Total=6806 [2022-11-25 22:44:47,064 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 222 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:47,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 329 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1126 Invalid, 0 Unknown, 74 Unchecked, 1.3s Time] [2022-11-25 22:44:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-25 22:44:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2022-11-25 22:44:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.3125) internal successors, (63), 56 states have internal predecessors, (63), 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) [2022-11-25 22:44:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-11-25 22:44:47,067 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 30 [2022-11-25 22:44:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:47,067 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-11-25 22:44:47,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.76) internal successors, (88), 51 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) [2022-11-25 22:44:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-11-25 22:44:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 22:44:47,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:47,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:47,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:47,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 22:44:47,269 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:44:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:47,270 INFO L85 PathProgramCache]: Analyzing trace with hash 955588939, now seen corresponding path program 1 times [2022-11-25 22:44:47,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:44:47,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448682055] [2022-11-25 22:44:47,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:47,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:44:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:44:48,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:44:48,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448682055] [2022-11-25 22:44:48,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448682055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:44:48,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193572713] [2022-11-25 22:44:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:48,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:44:48,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:44:48,404 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:44:48,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 22:44:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:48,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-25 22:44:48,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:48,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:44:48,791 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:44:48,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 22:44:48,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:48,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:44:48,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:44:49,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:44:49,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:44:49,575 INFO L321 Elim1Store]: treesize reduction 52, result has 36.6 percent of original size [2022-11-25 22:44:49,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 85 [2022-11-25 22:44:49,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:49,625 INFO L321 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2022-11-25 22:44:49,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 66 [2022-11-25 22:44:49,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:49,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:44:49,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:49,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:44:49,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 96 [2022-11-25 22:44:49,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:49,886 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-25 22:44:49,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 79 [2022-11-25 22:44:50,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:50,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:50,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 22:44:50,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 100 [2022-11-25 22:44:50,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:50,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:50,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:50,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 80 [2022-11-25 22:44:50,868 INFO L321 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-11-25 22:44:50,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 91 [2022-11-25 22:44:50,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-25 22:44:50,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-25 22:44:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:44:51,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:51,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:51,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 80 [2022-11-25 22:44:52,541 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1473 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1473))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse3 4))) (or (<= 0 (+ (select (select .cse0 .cse1) .cse2) 4)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse0 (select (select .cse4 .cse1) .cse2) v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) is different from false [2022-11-25 22:44:52,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:52,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 127 [2022-11-25 22:44:52,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:44:52,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:52,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 364 treesize of output 379 [2022-11-25 22:44:52,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:52,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 282 treesize of output 255 [2022-11-25 22:45:11,432 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse60 (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse24 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse95 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse433 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse434 (select (select .cse433 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse435 (+ .cse434 4))) (or (not (= (select (select (store .cse433 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse434 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse433 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse435) 4)) (= .cse435 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse269 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse430 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse431 (select (select .cse430 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse432 (+ .cse431 4))) (or (not (= (select (select (store .cse430 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse431 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse430 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse432) 4)) (= .cse432 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse268 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse428 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse429 (select (select .cse428 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse428 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse429 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse428 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse429 4)) 4))))))) (.cse94 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse426 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse427 (select (select .cse426 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse426 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse427 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse426 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse427 4)) 4))))))) (.cse3 (not .cse2))) (let ((.cse61 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse424 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse425 (select (select .cse424 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse424 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse425 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse424 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse425 4)) 4)))))) .cse3)) (.cse79 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse421 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse423 (select (select .cse421 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse422 (+ .cse423 4))) (or (<= 0 (+ (select (select .cse421 v_arrayElimCell_1044) .cse422) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse421 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse423 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse421 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse422) 4)) (= .cse422 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse62 (or .cse2 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse418 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse419 (select (select .cse418 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse420 (+ .cse419 4))) (or (not (= (select (select (store .cse418 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse419 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse418 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse420) 4)) (= .cse420 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse80 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse415 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse417 (select (select .cse415 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse416 (+ .cse417 4))) (or (<= 0 (+ (select (select .cse415 v_arrayElimCell_1044) .cse416) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse415 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse417 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse415 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse416) 4)) (= .cse416 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse63 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse412 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse414 (select (select .cse412 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse413 (+ .cse414 4))) (or (<= 0 (+ (select (select .cse412 v_arrayElimCell_1044) .cse413) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse412 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse414 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse412 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse413) 4))))))))) (.cse81 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse409 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse411 (select (select .cse409 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse410 (+ .cse411 4))) (or (<= 0 (+ (select (select .cse409 v_arrayElimCell_1044) .cse410) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse409 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse411 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse409 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse410) 4)) (= .cse410 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse82 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse406 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse408 (select (select .cse406 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse407 (+ .cse408 4))) (or (<= 0 (+ (select (select .cse406 v_arrayElimCell_1044) .cse407) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse406 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse408 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse406 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse407) 4))))))) .cse2)) (.cse64 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse404 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse405 (select (select .cse404 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse404 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse405 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse404 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse405 4)) 4)))))))) (.cse65 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse401 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse403 (select (select .cse401 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse402 (+ .cse403 4))) (or (<= 0 (+ (select (select .cse401 v_arrayElimCell_1044) .cse402) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse401 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse403 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse401 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse402) 4))))))))) (.cse83 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse398 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse400 (select (select .cse398 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse399 (+ .cse400 4))) (or (<= 0 (+ (select (select .cse398 v_arrayElimCell_1044) .cse399) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse398 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse400 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse398 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse399) 4))))))))) (.cse66 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse395 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse397 (select (select .cse395 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse396 (+ .cse397 4))) (or (<= 0 (+ (select (select .cse395 v_arrayElimCell_1044) .cse396) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse395 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse397 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse395 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse396) 4)) (= .cse396 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse67 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse392 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse394 (select (select .cse392 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse393 (+ .cse394 4))) (or (<= 0 (+ (select (select .cse392 v_arrayElimCell_1044) .cse393) 4)) (not (= (select (select (store .cse392 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse394 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse392 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse393) 4)) (= .cse393 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse68 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse389 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse391 (select (select .cse389 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse390 (+ .cse391 4))) (or (<= 0 (+ (select (select .cse389 v_arrayElimCell_1044) .cse390) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse389 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse391 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse389 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse390) 4)) (= .cse390 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse84 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse386 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse388 (select (select .cse386 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse387 (+ .cse388 4))) (or (<= 0 (+ (select (select .cse386 v_arrayElimCell_1044) .cse387) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse386 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse388 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse386 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse387) 4))))))))) (.cse69 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse383 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse385 (select (select .cse383 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse384 (+ .cse385 4))) (or (<= 0 (+ (select (select .cse383 v_arrayElimCell_1044) .cse384) 4)) (not (= (select (select (store .cse383 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse385 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse383 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse384) 4)) (= .cse384 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse70 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse380 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse382 (select (select .cse380 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse381 (+ .cse382 4))) (or (<= 0 (+ (select (select .cse380 v_arrayElimCell_1044) .cse381) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse380 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse382 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse380 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse381) 4))))))))) (.cse71 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse377 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse379 (select (select .cse377 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse378 (+ .cse379 4))) (or (<= 0 (+ (select (select .cse377 v_arrayElimCell_1044) .cse378) 4)) (not (= (select (select (store .cse377 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse379 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse377 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse378) 4))))))))) (.cse72 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse374 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse376 (select (select .cse374 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse375 (+ .cse376 4))) (or (<= 0 (+ (select (select .cse374 v_arrayElimCell_1044) .cse375) 4)) (not (= (select (select (store .cse374 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse376 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse374 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse375) 4)) (= .cse375 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse85 (or .cse2 .cse94)) (.cse73 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse371 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse373 (select (select .cse371 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse372 (+ .cse373 4))) (or (<= 0 (+ (select (select .cse371 v_arrayElimCell_1044) .cse372) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse371 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse373 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse371 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse372) 4)) (= .cse372 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse74 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse368 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse369 (select (select .cse368 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse370 (+ .cse369 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse368 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse369 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse368 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse370) 4)) (= .cse370 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse75 (or .cse2 .cse268)) (.cse86 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse365 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse367 (select (select .cse365 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse366 (+ .cse367 4))) (or (<= 0 (+ (select (select .cse365 v_arrayElimCell_1044) .cse366) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse365 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse367 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse365 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse366) 4))))))) .cse3)) (.cse76 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse363 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse364 (select (select .cse363 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse363 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse364 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse363 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse364 4)) 4)))))))) (.cse77 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse360 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse361 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse362 (+ .cse361 4))) (or (not (= (select (select (store .cse360 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse361 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse360 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse362) 4)) (= .cse362 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse78 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse357 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse359 (select (select .cse357 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse358 (+ .cse359 4))) (or (<= 0 (+ (select (select .cse357 v_arrayElimCell_1044) .cse358) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse357 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse359 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse357 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse358) 4)) (= .cse358 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse87 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse354 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse356 (select (select .cse354 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse355 (+ .cse356 4))) (or (<= 0 (+ (select (select .cse354 v_arrayElimCell_1044) .cse355) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse354 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse356 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse354 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse355) 4))))))) .cse3)) (.cse88 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse351 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse353 (select (select .cse351 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse352 (+ .cse353 4))) (or (<= 0 (+ (select (select .cse351 v_arrayElimCell_1044) .cse352) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse351 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse353 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse351 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse352) 4)) (= .cse352 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse89 (or .cse269 .cse2)) (.cse90 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse349 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse350 (select (select .cse349 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse349 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse350 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse349 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse350 4)) 4)))))))) (.cse91 (or .cse2 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse347 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse348 (select (select .cse347 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse347 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse348 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse347 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse348 4)) 4)))))))) (.cse92 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse344 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse346 (select (select .cse344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse345 (+ .cse346 4))) (or (<= 0 (+ (select (select .cse344 v_arrayElimCell_1044) .cse345) 4)) (not (= (select (select (store .cse344 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse346 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse344 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse345) 4)) (= .cse345 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse93 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse341 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse343 (select (select .cse341 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse342 (+ .cse343 4))) (or (<= 0 (+ (select (select .cse341 v_arrayElimCell_1044) .cse342) 4)) (not (= (select (select (store .cse341 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse343 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse341 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse342) 4))))))) .cse3)) (.cse29 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse338 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse339 (select (select .cse338 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse340 (+ .cse339 4))) (or (not (= (select (select (store .cse338 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse339 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse338 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse340) 4)) (= .cse340 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse49 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse335 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse337 (select (select .cse335 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse336 (+ .cse337 4))) (or (<= 0 (+ (select (select .cse335 v_arrayElimIndex_40) .cse336) 4)) (not (= (select (select (store .cse335 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse337 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse335 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse336) 4)) (= .cse336 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse1 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse333 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse334 (select (select .cse333 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse333 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse334 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse333 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse334 4)) 4))))))) (.cse25 (forall ((v_arrayElimIndex_40 Int)) (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse330 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse332 (select (select .cse330 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse331 (+ .cse332 4))) (or (<= 0 (+ (select (select .cse330 v_arrayElimIndex_40) .cse331) 4)) (not (= (select (select (store .cse330 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse332 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse330 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse331) 4)) (= .cse331 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (.cse26 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse327 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse329 (select (select .cse327 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse328 (+ .cse329 4))) (or (<= 0 (+ (select (select .cse327 v_arrayElimIndex_40) .cse328) 4)) (not (= (select (select (store .cse327 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse329 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse327 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse328) 4)) (= .cse328 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (.cse50 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse324 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse326 (select (select .cse324 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse325 (+ .cse326 4))) (or (<= 0 (+ (select (select .cse324 v_arrayElimIndex_40) .cse325) 4)) (not (= (select (select (store .cse324 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse326 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse324 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse325) 4)))))))))) (.cse58 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse321 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse322 (select (select .cse321 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse323 (+ .cse322 4))) (or (not (= (select (select (store .cse321 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse322 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse321 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse323) 4)) (= .cse323 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse54 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse318 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse320 (select (select .cse318 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse319 (+ .cse320 4))) (or (<= 0 (+ (select (select .cse318 v_arrayElimIndex_40) .cse319) 4)) (not (= (select (select (store .cse318 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse320 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse318 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse319) 4)) (= .cse319 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse12 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse315 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse317 (select (select .cse315 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse316 (+ .cse317 4))) (or (<= 0 (+ (select (select .cse315 v_arrayElimIndex_40) .cse316) 4)) (not (= (select (select (store .cse315 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse317 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse315 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse316) 4)) (= .cse316 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse16 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse312 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse314 (select (select .cse312 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse313 (+ .cse314 4))) (or (<= 0 (+ (select (select .cse312 v_arrayElimIndex_40) .cse313) 4)) (not (= (select (select (store .cse312 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse314 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse312 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse313) 4)) (= .cse313 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse8 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse309 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse311 (select (select .cse309 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse310 (+ .cse311 4))) (or (<= 0 (+ (select (select .cse309 v_arrayElimIndex_40) .cse310) 4)) (not (= (select (select (store .cse309 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse311 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse309 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse310) 4)))))))) (.cse27 (forall ((v_arrayElimIndex_40 Int)) (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse306 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse308 (select (select .cse306 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse307 (+ .cse308 4))) (or (<= 0 (+ (select (select .cse306 v_arrayElimIndex_40) .cse307) 4)) (not (= (select (select (store .cse306 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse308 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse306 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse307) 4))))))) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (.cse28 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse303 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse305 (select (select .cse303 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse304 (+ .cse305 4))) (or (<= 0 (+ (select (select .cse303 v_arrayElimIndex_40) .cse304) 4)) (not (= (select (select (store .cse303 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse305 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse303 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse304) 4)))))))))) (.cse57 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse300 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse302 (select (select .cse300 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse301 (+ .cse302 4))) (or (<= 0 (+ (select (select .cse300 v_arrayElimIndex_40) .cse301) 4)) (not (= (select (select (store .cse300 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse302 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse300 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse301) 4)))))))) (.cse34 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse297 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse298 (select (select .cse297 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse299 (+ .cse298 4))) (or (not (= (select (select (store .cse297 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse298 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse297 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse299) 4)) (= .cse299 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse40 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse294 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse296 (select (select .cse294 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse295 (+ .cse296 4))) (or (<= 0 (+ (select (select .cse294 v_arrayElimIndex_40) .cse295) 4)) (not (= (select (select (store .cse294 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse296 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse294 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse295) 4)))))))) (.cse35 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse292 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse293 (select (select .cse292 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse292 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse293 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse292 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse293 4)) 4))))))) (.cse55 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse290 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse291 (select (select .cse290 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse290 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse291 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse290 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse291 4)) 4))))))) (.cse45 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse287 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse289 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse288 (+ .cse289 4))) (or (<= 0 (+ (select (select .cse287 v_arrayElimIndex_40) .cse288) 4)) (not (= (select (select (store .cse287 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse289 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse287 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse288) 4)) (= .cse288 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse51 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse284 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse286 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse285 (+ .cse286 4))) (or (<= 0 (+ (select (select .cse284 v_arrayElimIndex_40) .cse285) 4)) (not (= (select (select (store .cse284 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse286 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse284 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse285) 4)))))))) (.cse52 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse281 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse283 (select (select .cse281 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse282 (+ .cse283 4))) (or (<= 0 (+ (select (select .cse281 v_arrayElimIndex_40) .cse282) 4)) (not (= (select (select (store .cse281 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse283 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse281 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse282) 4)) (= .cse282 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (.cse36 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse278 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse279 (select (select .cse278 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse280 (+ .cse279 4))) (or (not (= (select (select (store .cse278 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse279 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse278 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse280) 4)) (= .cse280 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse44 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse275 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse277 (select (select .cse275 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse276 (+ .cse277 4))) (or (<= 0 (+ (select (select .cse275 v_arrayElimIndex_40) .cse276) 4)) (not (= (select (select (store .cse275 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse277 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse275 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse276) 4)) (= .cse276 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse53 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse273 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse274 (select (select .cse273 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse273 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse274 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse273 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse274 4)) 4))))))) (.cse47 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse270 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse272 (select (select .cse270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse271 (+ .cse272 4))) (or (<= 0 (+ (select (select .cse270 v_arrayElimIndex_40) .cse271) 4)) (not (= (select (select (store .cse270 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse272 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse270 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse271) 4)) (= .cse271 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse152 (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse217 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (.cse23 (or .cse269 .cse3)) (.cse33 (or .cse2 .cse95)) (.cse46 (or .cse268 .cse3)) (.cse48 (or (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse265 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse266 (select (select .cse265 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse267 (+ .cse266 4))) (or (not (= (select (select (store .cse265 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse266 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse265 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse267) 4)) (= .cse267 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse56 (or .cse24 (and .cse94 .cse95))) (.cse59 (not .cse60))) (and (or (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (and (or (and (or .cse1 .cse2) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (+ .cse6 4))) (or (<= 0 (+ (select (select .cse4 v_arrayElimIndex_40) .cse5) 4)) (not (= (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5) 4)))))))) (or .cse2 .cse8) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse11 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ .cse11 4))) (or (<= 0 (+ (select (select .cse9 v_arrayElimIndex_40) .cse10) 4)) (not (= (select (select (store .cse9 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10) 4)) (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or .cse2 .cse12) (or (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse15 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (+ .cse15 4))) (or (<= 0 (+ (select (select .cse13 v_arrayElimIndex_40) .cse14) 4)) (not (= (select (select (store .cse13 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse14) 4)) (= .cse14 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse16) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse19 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (+ .cse19 4))) (or (<= 0 (+ (select (select .cse17 v_arrayElimIndex_40) .cse18) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= (select (select (store .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse18) 4)) (= .cse18 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse22 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (+ .cse22 4))) (or (<= 0 (+ (select (select .cse20 v_arrayElimIndex_40) .cse21) 4)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse21) 4))))))) .cse3) .cse23 (or .cse24 (and .cse25 .cse26 .cse27 .cse28)) (or .cse29 .cse2) (or .cse3 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse32 (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse31 (+ .cse32 4))) (or (<= 0 (+ (select (select .cse30 v_arrayElimIndex_40) .cse31) 4)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse31) 4)) (= .cse31 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse33 (or .cse2 .cse34) (or .cse24 (and .cse35 .cse36)) (or (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse39 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse38 (+ .cse39 4))) (or (<= 0 (+ (select (select .cse37 v_arrayElimIndex_40) .cse38) 4)) (not (= (select (select (store .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse38) 4)) (= .cse38 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse40) (or (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse43 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (+ .cse43 4))) (or (<= 0 (+ (select (select .cse41 v_arrayElimIndex_40) .cse42) 4)) (not (= (select (select (store .cse41 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse42) 4)) (= .cse42 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse44) (or .cse2 .cse45) .cse46 (or .cse2 .cse47) .cse48 (or .cse24 (and .cse49 .cse50 .cse51 .cse52)) (or .cse2 .cse53) (or .cse2 .cse54) (or .cse2 .cse55) .cse56 (or .cse2 .cse57) (or .cse2 .cse58)) .cse59) (or .cse60 (and .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 (or .cse24 (and .cse61 .cse79 .cse62 .cse80 .cse81 .cse82 .cse64 .cse65 .cse83 .cse66 .cse67 .cse84 .cse69 .cse71 .cse72 .cse33 .cse85 .cse73 .cse74 .cse75 .cse86 .cse76 .cse77 .cse87 .cse88 .cse89 .cse48 .cse90 .cse91 .cse92 .cse93)) .cse87 .cse89 .cse48 .cse90 .cse92 .cse93)))) (or .cse24 (and (or .cse60 (and .cse61 .cse79 .cse62 .cse80 .cse63 .cse81 .cse82 .cse64 .cse65 .cse83 .cse66 .cse67 .cse68 .cse84 .cse69 .cse70 .cse71 .cse72 .cse33 .cse85 .cse73 .cse74 .cse75 .cse86 .cse76 .cse77 .cse78 .cse87 .cse88 .cse89 .cse48 .cse90 .cse91 .cse92 .cse93)) (or (and .cse29 .cse49 .cse1 .cse25 .cse26 .cse50 .cse94 .cse58 .cse54 .cse12 .cse16 .cse8 .cse27 .cse28 .cse57 .cse34 .cse40 .cse35 .cse55 .cse45 .cse51 .cse52 .cse36 .cse95 .cse44 .cse53 .cse47) .cse59))) (or .cse60 (let ((.cse99 (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse115 (not .cse99))) (let ((.cse100 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse214 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse216 (select (select .cse214 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse215 (+ .cse216 4))) (or (<= 0 (+ (select (select .cse214 v_arrayElimCell_1044) .cse215) 4)) (<= 0 (+ (select (select .cse214 0) .cse215) 4)) (not (= .cse216 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse215 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse214 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (.cse101 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse211 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse213 (select (select .cse211 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse212 (+ .cse213 4))) (or (<= 0 (+ (select (select .cse211 v_arrayElimCell_1044) .cse212) 4)) (<= 0 (+ (select (select .cse211 0) .cse212) 4)) (not (= (select (select (store .cse211 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse213 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse115)) (.cse102 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse209 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse210 (select (select .cse209 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse209 0) (+ .cse210 4)) 4)) (not (= (select (select (store .cse209 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse210 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (.cse103 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse207 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse208 (select (select .cse207 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse207 0) (+ .cse208 4)) 4)) (not (= (select (select (store .cse207 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse208 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115)) (.cse104 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse204 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse206 (select (select .cse204 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse205 (+ .cse206 4))) (or (<= 0 (+ (select (select .cse204 v_arrayElimCell_1044) .cse205) 4)) (<= 0 (+ (select (select .cse204 0) .cse205) 4)) (not (= (select (select (store .cse204 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse206 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse205 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse111 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse201 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse203 (select (select .cse201 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse202 (+ .cse203 4))) (or (<= 0 (+ (select (select .cse201 0) .cse202) 4)) (not (= (select (select (store .cse201 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse203 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse202 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse114 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse198 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse200 (select (select .cse198 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse199 (+ .cse200 4))) (or (<= 0 (+ (select (select .cse198 v_arrayElimCell_1044) .cse199) 4)) (<= 0 (+ (select (select .cse198 0) .cse199) 4)) (not (= (select (select (store .cse198 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse200 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse199 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse122 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse195 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse197 (select (select .cse195 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse196 (+ .cse197 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse195 0) .cse196) 4)) (not (= (select (select (store .cse195 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse197 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse196 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse123 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse192 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse194 (select (select .cse192 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse193 (+ .cse194 4))) (or (<= 0 (+ (select (select .cse192 v_arrayElimCell_1044) .cse193) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse192 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse192 0) .cse193) 4)) (not (= .cse194 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse193 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse127 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse189 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse191 (select (select .cse189 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse190 (+ .cse191 4))) (or (<= 0 (+ (select (select .cse189 0) .cse190) 4)) (not (= .cse191 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse190 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse189 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99)) (.cse128 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse187 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse188 (select (select .cse187 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse187 0) (+ .cse188 4)) 4)) (not (= .cse188 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse187 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse131 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse184 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse186 (select (select .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse185 (+ .cse186 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse184 v_arrayElimCell_1044) .cse185) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse184 0) .cse185) 4)) (not (= (select (select (store .cse184 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse186 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (.cse132 (or .cse115 (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse181 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse183 (select (select .cse181 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse182 (+ .cse183 4))) (or (not (= (select (select (store .cse181 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse181 0) .cse182) 4)) (not (= .cse183 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse182 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse136 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse178 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse180 (select (select .cse178 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse179 (+ .cse180 4))) (or (<= 0 (+ (select (select .cse178 v_arrayElimCell_1044) .cse179) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse178 0) .cse179) 4)) (not (= (select (select (store .cse178 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse180 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse115)) (.cse137 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse176 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse177 (select (select .cse176 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse176 0) (+ .cse177 4)) 4)) (not (= (select (select (store .cse176 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse177 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115)) (.cse138 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse173 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse175 (select (select .cse173 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse174 (+ .cse175 4))) (or (<= 0 (+ (select (select .cse173 v_arrayElimCell_1044) .cse174) 4)) (not (= (select (select (store .cse173 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse173 0) .cse174) 4)) (not (= .cse175 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse174 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse145 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse170 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse172 (select (select .cse170 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse171 (+ .cse172 4))) (or (<= 0 (+ (select (select .cse170 0) .cse171) 4)) (not (= (select (select (store .cse170 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse172 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse171 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse146 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse167 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse169 (select (select .cse167 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse168 (+ .cse169 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse167 v_arrayElimCell_1044) .cse168) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse167 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse167 0) .cse168) 4)) (not (= .cse169 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse168 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse147 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse164 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse166 (select (select .cse164 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse165 (+ .cse166 4))) (or (<= 0 (+ (select (select .cse164 v_arrayElimCell_1044) .cse165) 4)) (<= 0 (+ (select (select .cse164 0) .cse165) 4)) (not (= .cse166 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse164 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99)) (.cse151 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse162 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse163 (select (select .cse162 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 0) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse162 0) (+ .cse163 4)) 4)) (not (= (select (select (store .cse162 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse163 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115))) (and (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse96 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse98 (select (select .cse96 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse97 (+ .cse98 4))) (or (<= 0 (+ (select (select .cse96 v_arrayElimCell_1044) .cse97) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse96 0) .cse97) 4)) (not (= .cse98 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse96 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse100 .cse101 .cse102 .cse103 .cse104 (or (and .cse100 .cse101 .cse102 .cse103 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse105 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse107 (select (select .cse105 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse106 (+ .cse107 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse105 v_arrayElimCell_1044) .cse106) 4)) (<= 0 (+ (select (select .cse105 0) .cse106) 4)) (not (= (select (select (store .cse105 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse107 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse106 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse108 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse110 (select (select .cse108 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse109 (+ .cse110 4))) (or (not (= (select (select (store .cse108 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse108 0) .cse109) 4)) (not (= .cse110 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse109 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse104 .cse111 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse112 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse113 (select (select .cse112 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse112 0) (+ .cse113 4)) 4)) (not (= (select (select (store .cse112 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse113 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse99) .cse114 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse116 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse118 (select (select .cse116 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse117 (+ .cse118 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse116 v_arrayElimCell_1044) .cse117) 4)) (<= 0 (+ (select (select .cse116 0) .cse117) 4)) (not (= (select (select (store .cse116 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse118 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse119 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse121 (select (select .cse119 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse120 (+ .cse121 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse119 v_arrayElimCell_1044) .cse120) 4)) (not (= (select (select (store .cse119 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse119 0) .cse120) 4)) (not (= .cse121 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse120 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse122 .cse123 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse124 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse126 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse125 (+ .cse126 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse124 v_arrayElimCell_1044) .cse125) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse124 0) .cse125) 4)) (not (= (select (select (store .cse124 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse126 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse125 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse99) .cse127 .cse128 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse129 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse130 (select (select .cse129 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse129 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse129 0) (+ .cse130 4)) 4)) (not (= .cse130 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse131 .cse132 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse133 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse135 (select (select .cse133 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse134 (+ .cse135 4))) (or (<= 0 (+ (select (select .cse133 v_arrayElimCell_1044) .cse134) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse133 0) .cse134) 4)) (not (= (select (select (store .cse133 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse135 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) .cse136 .cse137 .cse138 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse139 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse141 (select (select .cse139 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse140 (+ .cse141 4))) (or (<= 0 (+ (select (select .cse139 v_arrayElimCell_1044) .cse140) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse139 0) .cse140) 4)) (not (= (select (select (store .cse139 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse141 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse140 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse99) (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse142 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse144 (select (select .cse142 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse143 (+ .cse144 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse142 v_arrayElimCell_1044) .cse143) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse142 0) .cse143) 4)) (not (= (select (select (store .cse142 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse144 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse99) .cse145 .cse146 .cse147 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse148 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse150 (select (select .cse148 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse149 (+ .cse150 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse148 v_arrayElimCell_1044) .cse149) 4)) (<= 0 (+ (select (select .cse148 0) .cse149) 4)) (not (= (select (select (store .cse148 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse150 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) .cse151) .cse152) .cse111 .cse114 .cse122 .cse123 .cse127 .cse128 .cse131 .cse132 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse153 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse155 (select (select .cse153 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse154 (+ .cse155 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse153 v_arrayElimCell_1044) .cse154) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse153 0) .cse154) 4)) (not (= .cse155 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse153 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse136 .cse137 .cse138 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse156 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse158 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse157 (+ .cse158 4))) (or (<= 0 (+ (select (select .cse156 v_arrayElimCell_1044) .cse157) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse156 0) .cse157) 4)) (not (= .cse158 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse157 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse156 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) .cse145 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse159 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse161 (select (select .cse159 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse160 (+ .cse161 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse159 v_arrayElimCell_1044) .cse160) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse159 0) .cse160) 4)) (not (= .cse161 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse160 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse159 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse146 .cse147 .cse151)))) (not .cse217)) (or (let ((.cse222 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse263 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse262 (select (select .cse263 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse264 (+ .cse262 4))) (or (not (= .cse262 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse263 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse264) 4)) (= .cse264 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse263 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse221 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse261 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse260 (select (select .cse261 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse260 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse261 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse260 4)) 4)) (not (= (select (select (store .cse261 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (let ((.cse241 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse257 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse259 (select (select .cse257 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse258 (+ .cse259 4))) (or (not (= (select (select (store .cse257 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse257 0) .cse258) 4)) (not (= .cse259 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse257 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse258) 4)) (= .cse258 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse219 (or .cse221 .cse2)) (.cse223 (or .cse2 .cse222)) (.cse236 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse254 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse256 (select (select .cse254 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse255 (+ .cse256 4))) (or (<= 0 (+ (select (select .cse254 0) .cse255) 4)) (not (= .cse256 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse254 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse255) 4)) (not (= (select (select (store .cse254 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse237 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse251 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse253 (select (select .cse251 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse252 (+ .cse253 4))) (or (<= 0 (+ (select (select .cse251 0) .cse252) 4)) (not (= .cse253 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse251 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse252) 4)) (= .cse252 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse251 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (let ((.cse220 (or .cse3 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse248 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse250 (select (select .cse248 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse249 (+ .cse250 4))) (or (<= 0 (+ (select (select .cse248 0) .cse249) 4)) (not (= (select (select (store .cse248 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse250 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse248 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse249) 4)) (= .cse249 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse224 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse245 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse247 (select (select .cse245 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse246 (+ .cse247 4))) (or (<= 0 (+ (select (select .cse245 0) .cse246) 4)) (not (= (select (select (store .cse245 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse247 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse245 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse246) 4))))))) .cse3)) (.cse225 (or .cse2 .cse237)) (.cse227 (or .cse2 .cse236)) (.cse218 (and .cse23 .cse219 .cse33 .cse223 .cse46 .cse48 .cse56)) (.cse228 (or .cse217 (and .cse241 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse242 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse244 (select (select .cse242 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse243 (+ .cse244 4))) (or (not (= (select (select (store .cse242 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse242 0) .cse243) 4)) (not (= .cse244 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse242 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse243) 4)))))))))) (.cse226 (or .cse2 .cse241)) (.cse235 (or (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse238 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse240 (select (select .cse238 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse239 (+ .cse240 4))) (or (not (= (select (select (store .cse238 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse238 0) .cse239) 4)) (not (= .cse240 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse238 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse239) 4)) (= .cse239 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3))) (and (or .cse217 .cse218) .cse23 .cse219 .cse220 .cse33 (or .cse24 (and .cse221 .cse222)) .cse223 .cse224 .cse225 (or .cse217 (and .cse220 .cse226)) .cse227 (or (and (or .cse24 (and .cse228 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse229 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse231 (select (select .cse229 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse230 (+ .cse231 4))) (or (<= 0 (+ (select (select .cse229 0) .cse230) 4)) (not (= (select (select (store .cse229 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse231 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse229 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse230) 4)) (= .cse230 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse232 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse234 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse233 (+ .cse234 4))) (or (<= 0 (+ (select (select .cse232 0) .cse233) 4)) (not (= (select (select (store .cse232 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse234 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse232 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse233) 4))))))))) .cse220 .cse224 .cse225 .cse227 .cse226 (or (and .cse224 .cse225 .cse227 .cse235) .cse217) .cse235) .cse152) (or .cse218 .cse152) (or .cse24 (and .cse228 .cse236 .cse237)) .cse226 .cse46 (or .cse217 (and .cse226 .cse235)) .cse48 .cse235)))) .cse59))))) is different from false [2022-11-25 22:45:13,616 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse60 (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse24 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse95 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse433 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse434 (select (select .cse433 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse435 (+ .cse434 4))) (or (not (= (select (select (store .cse433 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse434 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse433 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse435) 4)) (= .cse435 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse269 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse430 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse431 (select (select .cse430 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse432 (+ .cse431 4))) (or (not (= (select (select (store .cse430 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse431 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse430 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse432) 4)) (= .cse432 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse268 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse428 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse429 (select (select .cse428 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse428 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse429 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse428 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse429 4)) 4))))))) (.cse94 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse426 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse427 (select (select .cse426 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse426 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse427 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse426 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse427 4)) 4))))))) (.cse3 (not .cse2))) (let ((.cse61 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse424 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse425 (select (select .cse424 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse424 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse425 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse424 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse425 4)) 4)))))) .cse3)) (.cse79 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse421 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse423 (select (select .cse421 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse422 (+ .cse423 4))) (or (<= 0 (+ (select (select .cse421 v_arrayElimCell_1044) .cse422) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse421 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse423 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse421 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse422) 4)) (= .cse422 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse62 (or .cse2 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse418 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse419 (select (select .cse418 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse420 (+ .cse419 4))) (or (not (= (select (select (store .cse418 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse419 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse418 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse420) 4)) (= .cse420 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse80 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse415 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse417 (select (select .cse415 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse416 (+ .cse417 4))) (or (<= 0 (+ (select (select .cse415 v_arrayElimCell_1044) .cse416) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse415 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse417 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse415 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse416) 4)) (= .cse416 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse63 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse412 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse414 (select (select .cse412 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse413 (+ .cse414 4))) (or (<= 0 (+ (select (select .cse412 v_arrayElimCell_1044) .cse413) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse412 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse414 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse412 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse413) 4))))))))) (.cse81 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse409 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse411 (select (select .cse409 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse410 (+ .cse411 4))) (or (<= 0 (+ (select (select .cse409 v_arrayElimCell_1044) .cse410) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse409 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse411 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse409 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse410) 4)) (= .cse410 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse82 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse406 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse408 (select (select .cse406 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse407 (+ .cse408 4))) (or (<= 0 (+ (select (select .cse406 v_arrayElimCell_1044) .cse407) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse406 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse408 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse406 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse407) 4))))))) .cse2)) (.cse64 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse404 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse405 (select (select .cse404 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse404 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse405 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse404 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse405 4)) 4)))))))) (.cse65 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse401 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse403 (select (select .cse401 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse402 (+ .cse403 4))) (or (<= 0 (+ (select (select .cse401 v_arrayElimCell_1044) .cse402) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse401 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse403 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse401 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse402) 4))))))))) (.cse83 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse398 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse400 (select (select .cse398 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse399 (+ .cse400 4))) (or (<= 0 (+ (select (select .cse398 v_arrayElimCell_1044) .cse399) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse398 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse400 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse398 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse399) 4))))))))) (.cse66 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse395 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse397 (select (select .cse395 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse396 (+ .cse397 4))) (or (<= 0 (+ (select (select .cse395 v_arrayElimCell_1044) .cse396) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse395 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse397 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse395 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse396) 4)) (= .cse396 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse67 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse392 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse394 (select (select .cse392 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse393 (+ .cse394 4))) (or (<= 0 (+ (select (select .cse392 v_arrayElimCell_1044) .cse393) 4)) (not (= (select (select (store .cse392 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse394 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse392 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse393) 4)) (= .cse393 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse68 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse389 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse391 (select (select .cse389 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse390 (+ .cse391 4))) (or (<= 0 (+ (select (select .cse389 v_arrayElimCell_1044) .cse390) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse389 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse391 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse389 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse390) 4)) (= .cse390 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse84 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse386 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse388 (select (select .cse386 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse387 (+ .cse388 4))) (or (<= 0 (+ (select (select .cse386 v_arrayElimCell_1044) .cse387) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse386 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse388 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse386 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse387) 4))))))))) (.cse69 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse383 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse385 (select (select .cse383 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse384 (+ .cse385 4))) (or (<= 0 (+ (select (select .cse383 v_arrayElimCell_1044) .cse384) 4)) (not (= (select (select (store .cse383 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse385 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse383 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse384) 4)) (= .cse384 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse70 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse380 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse382 (select (select .cse380 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse381 (+ .cse382 4))) (or (<= 0 (+ (select (select .cse380 v_arrayElimCell_1044) .cse381) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse380 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse382 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse380 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse381) 4))))))))) (.cse71 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse377 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse379 (select (select .cse377 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse378 (+ .cse379 4))) (or (<= 0 (+ (select (select .cse377 v_arrayElimCell_1044) .cse378) 4)) (not (= (select (select (store .cse377 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse379 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse377 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse378) 4))))))))) (.cse72 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse374 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse376 (select (select .cse374 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse375 (+ .cse376 4))) (or (<= 0 (+ (select (select .cse374 v_arrayElimCell_1044) .cse375) 4)) (not (= (select (select (store .cse374 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse376 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse374 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse375) 4)) (= .cse375 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse85 (or .cse2 .cse94)) (.cse73 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse371 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse373 (select (select .cse371 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse372 (+ .cse373 4))) (or (<= 0 (+ (select (select .cse371 v_arrayElimCell_1044) .cse372) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse371 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse373 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse371 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse372) 4)) (= .cse372 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse74 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse368 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse369 (select (select .cse368 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse370 (+ .cse369 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse368 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse369 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse368 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse370) 4)) (= .cse370 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse75 (or .cse2 .cse268)) (.cse86 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse365 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse367 (select (select .cse365 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse366 (+ .cse367 4))) (or (<= 0 (+ (select (select .cse365 v_arrayElimCell_1044) .cse366) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse365 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse367 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse365 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse366) 4))))))) .cse3)) (.cse76 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse363 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse364 (select (select .cse363 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse363 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse364 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse363 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse364 4)) 4)))))))) (.cse77 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse360 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse361 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse362 (+ .cse361 4))) (or (not (= (select (select (store .cse360 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse361 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse360 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse362) 4)) (= .cse362 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse78 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse357 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse359 (select (select .cse357 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse358 (+ .cse359 4))) (or (<= 0 (+ (select (select .cse357 v_arrayElimCell_1044) .cse358) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse357 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse359 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse357 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse358) 4)) (= .cse358 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse87 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse354 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse356 (select (select .cse354 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse355 (+ .cse356 4))) (or (<= 0 (+ (select (select .cse354 v_arrayElimCell_1044) .cse355) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse354 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse356 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse354 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse355) 4))))))) .cse3)) (.cse88 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse351 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse353 (select (select .cse351 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse352 (+ .cse353 4))) (or (<= 0 (+ (select (select .cse351 v_arrayElimCell_1044) .cse352) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse351 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse353 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse351 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse352) 4)) (= .cse352 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse89 (or .cse269 .cse2)) (.cse90 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse349 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse350 (select (select .cse349 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse349 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse350 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse349 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse350 4)) 4)))))))) (.cse91 (or .cse2 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse347 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse348 (select (select .cse347 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse347 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse348 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse347 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse348 4)) 4)))))))) (.cse92 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse344 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse346 (select (select .cse344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse345 (+ .cse346 4))) (or (<= 0 (+ (select (select .cse344 v_arrayElimCell_1044) .cse345) 4)) (not (= (select (select (store .cse344 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse346 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse344 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse345) 4)) (= .cse345 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse93 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse341 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse343 (select (select .cse341 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse342 (+ .cse343 4))) (or (<= 0 (+ (select (select .cse341 v_arrayElimCell_1044) .cse342) 4)) (not (= (select (select (store .cse341 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse343 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse341 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse342) 4))))))) .cse3)) (.cse29 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse338 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse339 (select (select .cse338 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse340 (+ .cse339 4))) (or (not (= (select (select (store .cse338 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse339 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse338 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse340) 4)) (= .cse340 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse49 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse335 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse337 (select (select .cse335 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse336 (+ .cse337 4))) (or (<= 0 (+ (select (select .cse335 v_arrayElimIndex_40) .cse336) 4)) (not (= (select (select (store .cse335 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse337 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse335 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse336) 4)) (= .cse336 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse1 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse333 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse334 (select (select .cse333 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse333 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse334 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse333 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse334 4)) 4))))))) (.cse25 (forall ((v_arrayElimIndex_40 Int)) (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse330 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse332 (select (select .cse330 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse331 (+ .cse332 4))) (or (<= 0 (+ (select (select .cse330 v_arrayElimIndex_40) .cse331) 4)) (not (= (select (select (store .cse330 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse332 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse330 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse331) 4)) (= .cse331 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (.cse26 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse327 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse329 (select (select .cse327 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse328 (+ .cse329 4))) (or (<= 0 (+ (select (select .cse327 v_arrayElimIndex_40) .cse328) 4)) (not (= (select (select (store .cse327 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse329 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse327 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse328) 4)) (= .cse328 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (.cse50 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse324 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse326 (select (select .cse324 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse325 (+ .cse326 4))) (or (<= 0 (+ (select (select .cse324 v_arrayElimIndex_40) .cse325) 4)) (not (= (select (select (store .cse324 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse326 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse324 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse325) 4)))))))))) (.cse58 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse321 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse322 (select (select .cse321 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse323 (+ .cse322 4))) (or (not (= (select (select (store .cse321 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse322 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse321 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse323) 4)) (= .cse323 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse54 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse318 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse320 (select (select .cse318 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse319 (+ .cse320 4))) (or (<= 0 (+ (select (select .cse318 v_arrayElimIndex_40) .cse319) 4)) (not (= (select (select (store .cse318 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse320 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse318 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse319) 4)) (= .cse319 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse12 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse315 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse317 (select (select .cse315 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse316 (+ .cse317 4))) (or (<= 0 (+ (select (select .cse315 v_arrayElimIndex_40) .cse316) 4)) (not (= (select (select (store .cse315 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse317 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse315 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse316) 4)) (= .cse316 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse16 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse312 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse314 (select (select .cse312 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse313 (+ .cse314 4))) (or (<= 0 (+ (select (select .cse312 v_arrayElimIndex_40) .cse313) 4)) (not (= (select (select (store .cse312 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse314 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse312 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse313) 4)) (= .cse313 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse8 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse309 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse311 (select (select .cse309 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse310 (+ .cse311 4))) (or (<= 0 (+ (select (select .cse309 v_arrayElimIndex_40) .cse310) 4)) (not (= (select (select (store .cse309 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse311 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse309 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse310) 4)))))))) (.cse27 (forall ((v_arrayElimIndex_40 Int)) (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse306 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse308 (select (select .cse306 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse307 (+ .cse308 4))) (or (<= 0 (+ (select (select .cse306 v_arrayElimIndex_40) .cse307) 4)) (not (= (select (select (store .cse306 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse308 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse306 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse307) 4))))))) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (.cse28 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse303 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse305 (select (select .cse303 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse304 (+ .cse305 4))) (or (<= 0 (+ (select (select .cse303 v_arrayElimIndex_40) .cse304) 4)) (not (= (select (select (store .cse303 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse305 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse303 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse304) 4)))))))))) (.cse57 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse300 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse302 (select (select .cse300 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse301 (+ .cse302 4))) (or (<= 0 (+ (select (select .cse300 v_arrayElimIndex_40) .cse301) 4)) (not (= (select (select (store .cse300 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse302 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse300 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse301) 4)))))))) (.cse34 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse297 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse298 (select (select .cse297 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse299 (+ .cse298 4))) (or (not (= (select (select (store .cse297 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse298 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse297 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse299) 4)) (= .cse299 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse40 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse294 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse296 (select (select .cse294 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse295 (+ .cse296 4))) (or (<= 0 (+ (select (select .cse294 v_arrayElimIndex_40) .cse295) 4)) (not (= (select (select (store .cse294 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse296 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse294 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse295) 4)))))))) (.cse35 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse292 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse293 (select (select .cse292 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse292 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse293 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse292 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse293 4)) 4))))))) (.cse55 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse290 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse291 (select (select .cse290 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse290 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse291 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse290 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse291 4)) 4))))))) (.cse45 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse287 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse289 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse288 (+ .cse289 4))) (or (<= 0 (+ (select (select .cse287 v_arrayElimIndex_40) .cse288) 4)) (not (= (select (select (store .cse287 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse289 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse287 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse288) 4)) (= .cse288 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse51 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse284 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse286 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse285 (+ .cse286 4))) (or (<= 0 (+ (select (select .cse284 v_arrayElimIndex_40) .cse285) 4)) (not (= (select (select (store .cse284 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse286 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse284 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse285) 4)))))))) (.cse52 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse281 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse283 (select (select .cse281 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse282 (+ .cse283 4))) (or (<= 0 (+ (select (select .cse281 v_arrayElimIndex_40) .cse282) 4)) (not (= (select (select (store .cse281 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse283 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse281 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse282) 4)) (= .cse282 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (.cse36 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse278 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse279 (select (select .cse278 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse280 (+ .cse279 4))) (or (not (= (select (select (store .cse278 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse279 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse278 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse280) 4)) (= .cse280 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse44 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse275 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse277 (select (select .cse275 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse276 (+ .cse277 4))) (or (<= 0 (+ (select (select .cse275 v_arrayElimIndex_40) .cse276) 4)) (not (= (select (select (store .cse275 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse277 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse275 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse276) 4)) (= .cse276 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse53 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse273 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse274 (select (select .cse273 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse273 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse274 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse273 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse274 4)) 4))))))) (.cse47 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse270 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse272 (select (select .cse270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse271 (+ .cse272 4))) (or (<= 0 (+ (select (select .cse270 v_arrayElimIndex_40) .cse271) 4)) (not (= (select (select (store .cse270 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse272 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse270 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse271) 4)) (= .cse271 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse152 (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse217 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (.cse23 (or .cse269 .cse3)) (.cse33 (or .cse2 .cse95)) (.cse46 (or .cse268 .cse3)) (.cse48 (or (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse265 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse266 (select (select .cse265 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse267 (+ .cse266 4))) (or (not (= (select (select (store .cse265 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse266 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse265 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse267) 4)) (= .cse267 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse56 (or .cse24 (and .cse94 .cse95))) (.cse59 (not .cse60))) (and (or (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (and (or (and (or .cse1 .cse2) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (+ .cse6 4))) (or (<= 0 (+ (select (select .cse4 v_arrayElimIndex_40) .cse5) 4)) (not (= (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5) 4)))))))) (or .cse2 .cse8) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse11 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ .cse11 4))) (or (<= 0 (+ (select (select .cse9 v_arrayElimIndex_40) .cse10) 4)) (not (= (select (select (store .cse9 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10) 4)) (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or .cse2 .cse12) (or (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse15 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (+ .cse15 4))) (or (<= 0 (+ (select (select .cse13 v_arrayElimIndex_40) .cse14) 4)) (not (= (select (select (store .cse13 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse14) 4)) (= .cse14 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse16) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse19 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (+ .cse19 4))) (or (<= 0 (+ (select (select .cse17 v_arrayElimIndex_40) .cse18) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= (select (select (store .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse18) 4)) (= .cse18 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse22 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (+ .cse22 4))) (or (<= 0 (+ (select (select .cse20 v_arrayElimIndex_40) .cse21) 4)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse21) 4))))))) .cse3) .cse23 (or .cse24 (and .cse25 .cse26 .cse27 .cse28)) (or .cse29 .cse2) (or .cse3 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse32 (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse31 (+ .cse32 4))) (or (<= 0 (+ (select (select .cse30 v_arrayElimIndex_40) .cse31) 4)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse31) 4)) (= .cse31 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse33 (or .cse2 .cse34) (or .cse24 (and .cse35 .cse36)) (or (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse39 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse38 (+ .cse39 4))) (or (<= 0 (+ (select (select .cse37 v_arrayElimIndex_40) .cse38) 4)) (not (= (select (select (store .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse38) 4)) (= .cse38 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse40) (or (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse43 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (+ .cse43 4))) (or (<= 0 (+ (select (select .cse41 v_arrayElimIndex_40) .cse42) 4)) (not (= (select (select (store .cse41 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse42) 4)) (= .cse42 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse44) (or .cse2 .cse45) .cse46 (or .cse2 .cse47) .cse48 (or .cse24 (and .cse49 .cse50 .cse51 .cse52)) (or .cse2 .cse53) (or .cse2 .cse54) (or .cse2 .cse55) .cse56 (or .cse2 .cse57) (or .cse2 .cse58)) .cse59) (or .cse60 (and .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 (or .cse24 (and .cse61 .cse79 .cse62 .cse80 .cse81 .cse82 .cse64 .cse65 .cse83 .cse66 .cse67 .cse84 .cse69 .cse71 .cse72 .cse33 .cse85 .cse73 .cse74 .cse75 .cse86 .cse76 .cse77 .cse87 .cse88 .cse89 .cse48 .cse90 .cse91 .cse92 .cse93)) .cse87 .cse89 .cse48 .cse90 .cse92 .cse93)))) (or .cse24 (and (or .cse60 (and .cse61 .cse79 .cse62 .cse80 .cse63 .cse81 .cse82 .cse64 .cse65 .cse83 .cse66 .cse67 .cse68 .cse84 .cse69 .cse70 .cse71 .cse72 .cse33 .cse85 .cse73 .cse74 .cse75 .cse86 .cse76 .cse77 .cse78 .cse87 .cse88 .cse89 .cse48 .cse90 .cse91 .cse92 .cse93)) (or (and .cse29 .cse49 .cse1 .cse25 .cse26 .cse50 .cse94 .cse58 .cse54 .cse12 .cse16 .cse8 .cse27 .cse28 .cse57 .cse34 .cse40 .cse35 .cse55 .cse45 .cse51 .cse52 .cse36 .cse95 .cse44 .cse53 .cse47) .cse59))) (or .cse60 (let ((.cse99 (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse115 (not .cse99))) (let ((.cse100 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse214 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse216 (select (select .cse214 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse215 (+ .cse216 4))) (or (<= 0 (+ (select (select .cse214 v_arrayElimCell_1044) .cse215) 4)) (<= 0 (+ (select (select .cse214 0) .cse215) 4)) (not (= .cse216 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse215 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse214 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (.cse101 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse211 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse213 (select (select .cse211 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse212 (+ .cse213 4))) (or (<= 0 (+ (select (select .cse211 v_arrayElimCell_1044) .cse212) 4)) (<= 0 (+ (select (select .cse211 0) .cse212) 4)) (not (= (select (select (store .cse211 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse213 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse115)) (.cse102 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse209 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse210 (select (select .cse209 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse209 0) (+ .cse210 4)) 4)) (not (= (select (select (store .cse209 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse210 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (.cse103 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse207 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse208 (select (select .cse207 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse207 0) (+ .cse208 4)) 4)) (not (= (select (select (store .cse207 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse208 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115)) (.cse104 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse204 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse206 (select (select .cse204 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse205 (+ .cse206 4))) (or (<= 0 (+ (select (select .cse204 v_arrayElimCell_1044) .cse205) 4)) (<= 0 (+ (select (select .cse204 0) .cse205) 4)) (not (= (select (select (store .cse204 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse206 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse205 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse111 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse201 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse203 (select (select .cse201 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse202 (+ .cse203 4))) (or (<= 0 (+ (select (select .cse201 0) .cse202) 4)) (not (= (select (select (store .cse201 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse203 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse202 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse114 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse198 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse200 (select (select .cse198 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse199 (+ .cse200 4))) (or (<= 0 (+ (select (select .cse198 v_arrayElimCell_1044) .cse199) 4)) (<= 0 (+ (select (select .cse198 0) .cse199) 4)) (not (= (select (select (store .cse198 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse200 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse199 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse122 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse195 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse197 (select (select .cse195 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse196 (+ .cse197 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse195 0) .cse196) 4)) (not (= (select (select (store .cse195 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse197 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse196 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse123 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse192 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse194 (select (select .cse192 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse193 (+ .cse194 4))) (or (<= 0 (+ (select (select .cse192 v_arrayElimCell_1044) .cse193) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse192 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse192 0) .cse193) 4)) (not (= .cse194 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse193 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse127 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse189 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse191 (select (select .cse189 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse190 (+ .cse191 4))) (or (<= 0 (+ (select (select .cse189 0) .cse190) 4)) (not (= .cse191 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse190 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse189 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99)) (.cse128 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse187 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse188 (select (select .cse187 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse187 0) (+ .cse188 4)) 4)) (not (= .cse188 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse187 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse131 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse184 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse186 (select (select .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse185 (+ .cse186 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse184 v_arrayElimCell_1044) .cse185) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse184 0) .cse185) 4)) (not (= (select (select (store .cse184 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse186 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (.cse132 (or .cse115 (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse181 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse183 (select (select .cse181 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse182 (+ .cse183 4))) (or (not (= (select (select (store .cse181 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse181 0) .cse182) 4)) (not (= .cse183 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse182 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse136 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse178 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse180 (select (select .cse178 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse179 (+ .cse180 4))) (or (<= 0 (+ (select (select .cse178 v_arrayElimCell_1044) .cse179) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse178 0) .cse179) 4)) (not (= (select (select (store .cse178 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse180 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse115)) (.cse137 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse176 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse177 (select (select .cse176 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse176 0) (+ .cse177 4)) 4)) (not (= (select (select (store .cse176 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse177 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115)) (.cse138 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse173 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse175 (select (select .cse173 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse174 (+ .cse175 4))) (or (<= 0 (+ (select (select .cse173 v_arrayElimCell_1044) .cse174) 4)) (not (= (select (select (store .cse173 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse173 0) .cse174) 4)) (not (= .cse175 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse174 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse145 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse170 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse172 (select (select .cse170 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse171 (+ .cse172 4))) (or (<= 0 (+ (select (select .cse170 0) .cse171) 4)) (not (= (select (select (store .cse170 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse172 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse171 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse146 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse167 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse169 (select (select .cse167 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse168 (+ .cse169 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse167 v_arrayElimCell_1044) .cse168) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse167 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse167 0) .cse168) 4)) (not (= .cse169 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse168 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse147 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse164 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse166 (select (select .cse164 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse165 (+ .cse166 4))) (or (<= 0 (+ (select (select .cse164 v_arrayElimCell_1044) .cse165) 4)) (<= 0 (+ (select (select .cse164 0) .cse165) 4)) (not (= .cse166 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse164 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99)) (.cse151 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse162 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse163 (select (select .cse162 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 0) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse162 0) (+ .cse163 4)) 4)) (not (= (select (select (store .cse162 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse163 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115))) (and (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse96 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse98 (select (select .cse96 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse97 (+ .cse98 4))) (or (<= 0 (+ (select (select .cse96 v_arrayElimCell_1044) .cse97) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse96 0) .cse97) 4)) (not (= .cse98 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse96 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse100 .cse101 .cse102 .cse103 .cse104 (or (and .cse100 .cse101 .cse102 .cse103 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse105 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse107 (select (select .cse105 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse106 (+ .cse107 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse105 v_arrayElimCell_1044) .cse106) 4)) (<= 0 (+ (select (select .cse105 0) .cse106) 4)) (not (= (select (select (store .cse105 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse107 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse106 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse108 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse110 (select (select .cse108 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse109 (+ .cse110 4))) (or (not (= (select (select (store .cse108 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse108 0) .cse109) 4)) (not (= .cse110 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse109 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse104 .cse111 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse112 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse113 (select (select .cse112 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse112 0) (+ .cse113 4)) 4)) (not (= (select (select (store .cse112 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse113 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse99) .cse114 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse116 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse118 (select (select .cse116 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse117 (+ .cse118 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse116 v_arrayElimCell_1044) .cse117) 4)) (<= 0 (+ (select (select .cse116 0) .cse117) 4)) (not (= (select (select (store .cse116 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse118 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse119 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse121 (select (select .cse119 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse120 (+ .cse121 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse119 v_arrayElimCell_1044) .cse120) 4)) (not (= (select (select (store .cse119 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse119 0) .cse120) 4)) (not (= .cse121 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse120 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse122 .cse123 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse124 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse126 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse125 (+ .cse126 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse124 v_arrayElimCell_1044) .cse125) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse124 0) .cse125) 4)) (not (= (select (select (store .cse124 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse126 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse125 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse99) .cse127 .cse128 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse129 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse130 (select (select .cse129 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse129 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse129 0) (+ .cse130 4)) 4)) (not (= .cse130 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse131 .cse132 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse133 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse135 (select (select .cse133 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse134 (+ .cse135 4))) (or (<= 0 (+ (select (select .cse133 v_arrayElimCell_1044) .cse134) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse133 0) .cse134) 4)) (not (= (select (select (store .cse133 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse135 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) .cse136 .cse137 .cse138 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse139 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse141 (select (select .cse139 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse140 (+ .cse141 4))) (or (<= 0 (+ (select (select .cse139 v_arrayElimCell_1044) .cse140) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse139 0) .cse140) 4)) (not (= (select (select (store .cse139 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse141 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse140 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse99) (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse142 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse144 (select (select .cse142 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse143 (+ .cse144 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse142 v_arrayElimCell_1044) .cse143) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse142 0) .cse143) 4)) (not (= (select (select (store .cse142 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse144 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse99) .cse145 .cse146 .cse147 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse148 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse150 (select (select .cse148 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse149 (+ .cse150 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse148 v_arrayElimCell_1044) .cse149) 4)) (<= 0 (+ (select (select .cse148 0) .cse149) 4)) (not (= (select (select (store .cse148 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse150 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) .cse151) .cse152) .cse111 .cse114 .cse122 .cse123 .cse127 .cse128 .cse131 .cse132 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse153 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse155 (select (select .cse153 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse154 (+ .cse155 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse153 v_arrayElimCell_1044) .cse154) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse153 0) .cse154) 4)) (not (= .cse155 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse153 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse136 .cse137 .cse138 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse156 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse158 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse157 (+ .cse158 4))) (or (<= 0 (+ (select (select .cse156 v_arrayElimCell_1044) .cse157) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse156 0) .cse157) 4)) (not (= .cse158 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse157 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse156 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) .cse145 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse159 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse161 (select (select .cse159 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse160 (+ .cse161 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse159 v_arrayElimCell_1044) .cse160) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse159 0) .cse160) 4)) (not (= .cse161 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse160 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse159 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse146 .cse147 .cse151)))) (not .cse217)) (or (let ((.cse222 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse263 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse262 (select (select .cse263 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse264 (+ .cse262 4))) (or (not (= .cse262 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse263 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse264) 4)) (= .cse264 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse263 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse221 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse261 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse260 (select (select .cse261 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse260 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse261 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse260 4)) 4)) (not (= (select (select (store .cse261 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (let ((.cse241 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse257 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse259 (select (select .cse257 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse258 (+ .cse259 4))) (or (not (= (select (select (store .cse257 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse257 0) .cse258) 4)) (not (= .cse259 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse257 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse258) 4)) (= .cse258 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse219 (or .cse221 .cse2)) (.cse223 (or .cse2 .cse222)) (.cse236 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse254 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse256 (select (select .cse254 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse255 (+ .cse256 4))) (or (<= 0 (+ (select (select .cse254 0) .cse255) 4)) (not (= .cse256 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse254 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse255) 4)) (not (= (select (select (store .cse254 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse237 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse251 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse253 (select (select .cse251 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse252 (+ .cse253 4))) (or (<= 0 (+ (select (select .cse251 0) .cse252) 4)) (not (= .cse253 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse251 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse252) 4)) (= .cse252 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse251 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (let ((.cse220 (or .cse3 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse248 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse250 (select (select .cse248 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse249 (+ .cse250 4))) (or (<= 0 (+ (select (select .cse248 0) .cse249) 4)) (not (= (select (select (store .cse248 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse250 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse248 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse249) 4)) (= .cse249 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse224 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse245 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse247 (select (select .cse245 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse246 (+ .cse247 4))) (or (<= 0 (+ (select (select .cse245 0) .cse246) 4)) (not (= (select (select (store .cse245 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse247 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse245 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse246) 4))))))) .cse3)) (.cse225 (or .cse2 .cse237)) (.cse227 (or .cse2 .cse236)) (.cse218 (and .cse23 .cse219 .cse33 .cse223 .cse46 .cse48 .cse56)) (.cse228 (or .cse217 (and .cse241 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse242 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse244 (select (select .cse242 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse243 (+ .cse244 4))) (or (not (= (select (select (store .cse242 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse242 0) .cse243) 4)) (not (= .cse244 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse242 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse243) 4)))))))))) (.cse226 (or .cse2 .cse241)) (.cse235 (or (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse238 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse240 (select (select .cse238 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse239 (+ .cse240 4))) (or (not (= (select (select (store .cse238 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse238 0) .cse239) 4)) (not (= .cse240 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse238 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse239) 4)) (= .cse239 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3))) (and (or .cse217 .cse218) .cse23 .cse219 .cse220 .cse33 (or .cse24 (and .cse221 .cse222)) .cse223 .cse224 .cse225 (or .cse217 (and .cse220 .cse226)) .cse227 (or (and (or .cse24 (and .cse228 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse229 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse231 (select (select .cse229 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse230 (+ .cse231 4))) (or (<= 0 (+ (select (select .cse229 0) .cse230) 4)) (not (= (select (select (store .cse229 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse231 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse229 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse230) 4)) (= .cse230 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse232 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse234 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse233 (+ .cse234 4))) (or (<= 0 (+ (select (select .cse232 0) .cse233) 4)) (not (= (select (select (store .cse232 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse234 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse232 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse233) 4))))))))) .cse220 .cse224 .cse225 .cse227 .cse226 (or (and .cse224 .cse225 .cse227 .cse235) .cse217) .cse235) .cse152) (or .cse218 .cse152) (or .cse24 (and .cse228 .cse236 .cse237)) .cse226 .cse46 (or .cse217 (and .cse226 .cse235)) .cse48 .cse235)))) .cse59))))) is different from true [2022-11-25 22:45:16,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:16,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 88 [2022-11-25 22:45:16,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:16,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:16,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:16,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:16,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:16,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 33 [2022-11-25 22:45:16,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-25 22:45:16,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:16,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 67 [2022-11-25 22:45:16,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:16,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:16,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:16,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2022-11-25 22:45:16,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-25 22:45:16,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-25 22:45:16,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:16,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 100 [2022-11-25 22:45:16,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:16,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:16,741 INFO L321 Elim1Store]: treesize reduction 31, result has 11.4 percent of original size [2022-11-25 22:45:16,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 72 [2022-11-25 22:45:16,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:16,777 INFO L350 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 6 treesize of output 4 [2022-11-25 22:45:16,798 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:16,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:16,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:16,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 67 [2022-11-25 22:45:16,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:16,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:16,889 INFO L321 Elim1Store]: treesize reduction 22, result has 37.1 percent of original size [2022-11-25 22:45:16,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 52 [2022-11-25 22:45:16,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 22:45:16,935 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:16,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:16,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:16,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 79 [2022-11-25 22:45:16,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:16,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,018 INFO L321 Elim1Store]: treesize reduction 31, result has 11.4 percent of original size [2022-11-25 22:45:17,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 49 [2022-11-25 22:45:17,041 INFO L350 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 6 treesize of output 4 [2022-11-25 22:45:17,063 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:17,079 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:17,094 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:17,109 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:17,123 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:17,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:17,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 67 [2022-11-25 22:45:17,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,183 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:45:17,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 44 [2022-11-25 22:45:17,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 22:45:17,216 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:17,230 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:17,243 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:17,256 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:17,269 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:17,283 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:17,297 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:17,313 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:17,327 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:17,347 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:17,360 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:17,373 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:17,386 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:17,401 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:17,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:17,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:17,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 100 [2022-11-25 22:45:17,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,557 INFO L321 Elim1Store]: treesize reduction 30, result has 30.2 percent of original size [2022-11-25 22:45:17,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 64 [2022-11-25 22:45:17,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:17,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:17,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 88 [2022-11-25 22:45:17,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,704 INFO L321 Elim1Store]: treesize reduction 27, result has 37.2 percent of original size [2022-11-25 22:45:17,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 62 [2022-11-25 22:45:17,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-25 22:45:17,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:17,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 79 [2022-11-25 22:45:17,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,795 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:45:17,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2022-11-25 22:45:17,815 INFO L350 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 6 treesize of output 4 [2022-11-25 22:45:17,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:17,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 100 [2022-11-25 22:45:17,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:17,898 INFO L321 Elim1Store]: treesize reduction 5, result has 61.5 percent of original size [2022-11-25 22:45:17,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 80 [2022-11-25 22:45:17,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-25 22:45:17,943 INFO L350 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 6 treesize of output 4 [2022-11-25 22:45:17,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:17,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 88 [2022-11-25 22:45:17,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:17,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:17,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 33 [2022-11-25 22:45:18,017 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:18,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:18,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 67 [2022-11-25 22:45:18,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:18,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:18,073 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:45:18,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 44 [2022-11-25 22:45:18,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 22:45:18,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:18,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 88 [2022-11-25 22:45:18,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:18,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:18,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:18,160 INFO L321 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2022-11-25 22:45:18,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 53 [2022-11-25 22:45:18,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-25 22:45:18,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-25 22:45:18,214 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,230 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,252 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,273 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,292 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:18,313 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:18,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:18,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 67 [2022-11-25 22:45:18,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:18,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:18,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2022-11-25 22:45:18,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-25 22:45:18,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-25 22:45:18,414 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:18,431 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,445 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:18,470 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,484 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:18,499 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,520 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,539 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,557 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,575 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,593 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:18,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 67 [2022-11-25 22:45:18,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:18,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:18,653 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:45:18,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2022-11-25 22:45:18,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-25 22:45:18,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 22:45:18,698 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,711 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:18,726 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,740 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:18,755 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,770 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,785 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,800 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:18,815 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:18,830 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,846 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,861 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,876 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:18,891 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:18,905 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:18,921 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,937 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,953 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,967 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,982 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:18,997 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:18,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,011 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:19,026 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,041 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:19,056 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:19,072 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:19,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:19,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 88 [2022-11-25 22:45:19,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:19,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:19,209 INFO L321 Elim1Store]: treesize reduction 5, result has 61.5 percent of original size [2022-11-25 22:45:19,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 61 [2022-11-25 22:45:19,220 INFO L350 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 6 treesize of output 4 [2022-11-25 22:45:19,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:19,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-25 22:45:19,295 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:19,311 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:19,331 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,349 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,366 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:19,384 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:19,402 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:19,430 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:19,454 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,478 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,503 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,528 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,551 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:19,576 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,600 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,623 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,646 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:19,670 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,688 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:19,704 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:19,728 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:19,750 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:19,784 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:19,803 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:19,818 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:19,838 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,858 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:19,878 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:19,896 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:19,910 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,931 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,951 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:19,965 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:19,978 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:19,996 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:19,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:20,010 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:20,029 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:20,044 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:20,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:20,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 100 [2022-11-25 22:45:20,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:20,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:20,198 INFO L321 Elim1Store]: treesize reduction 54, result has 19.4 percent of original size [2022-11-25 22:45:20,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 80 [2022-11-25 22:45:20,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2022-11-25 22:45:20,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:20,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:20,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 88 [2022-11-25 22:45:20,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:20,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:20,387 INFO L321 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-11-25 22:45:20,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 79 [2022-11-25 22:45:20,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:20,425 INFO L350 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 6 treesize of output 4 [2022-11-25 22:45:20,472 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:20,485 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-25 22:45:20,502 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:20,527 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:20,541 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-25 22:45:20,559 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:20,595 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:20,617 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:20,639 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:20,676 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:20,698 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:20,716 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:20,745 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:20,767 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:20,779 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-25 22:45:20,800 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:20,818 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:20,834 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:20,848 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-25 22:45:20,869 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:20,901 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:20,936 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:20,965 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:20,991 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:20,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:21,029 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:21,056 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,084 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,144 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:21,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:21,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 79 [2022-11-25 22:45:21,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:21,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:21,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-11-25 22:45:21,216 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:45:21,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-11-25 22:45:21,235 INFO L350 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 6 treesize of output 4 [2022-11-25 22:45:21,258 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:21,275 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:21,292 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:21,315 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:21,338 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:21,360 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:21,391 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,409 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,435 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,459 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:21,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:21,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 79 [2022-11-25 22:45:21,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:21,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:21,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-11-25 22:45:21,539 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:45:21,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-11-25 22:45:21,558 INFO L350 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 6 treesize of output 4 [2022-11-25 22:45:21,577 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:21,603 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:21,627 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:21,643 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:21,665 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,688 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:21,712 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,740 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,758 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:21,784 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,804 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,822 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:21,848 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,867 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:21,892 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,911 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,936 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:21,977 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:21,995 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:21,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:22,021 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:22,045 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:22,065 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:22,104 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:22,120 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:22,134 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:22,155 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:22,170 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:22,190 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:22,211 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:22,226 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 1 [2022-11-25 22:45:22,247 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 1 [2022-11-25 22:45:22,276 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:22,300 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:22,323 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:22,338 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:22,353 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:22,374 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:22,394 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 1 [2022-11-25 22:45:22,414 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-25 22:45:22,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 1 [2022-11-25 22:45:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 22:45:24,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193572713] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:24,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1062423989] [2022-11-25 22:45:24,285 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-25 22:45:24,285 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:45:24,285 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:45:24,286 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:45:24,286 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:45:24,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 22:45:24,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 22:45:24,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:45:24,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:24,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:24,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:24,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:24,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:45:24,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:45:24,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:45:24,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:45:24,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-25 22:45:24,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:45:24,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:45:24,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:45:24,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:45:24,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:24,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:45:24,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:24,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:45:24,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:45:24,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:45:24,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:24,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:45:25,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:25,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-25 22:45:25,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:45:25,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:45:25,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:45:25,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:45:25,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:45:25,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:25,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:45:25,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:45:25,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:25,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:45:25,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:25,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:25,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:45:25,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:26,049 INFO L321 Elim1Store]: treesize reduction 46, result has 49.5 percent of original size [2022-11-25 22:45:26,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 92 [2022-11-25 22:45:26,165 INFO L321 Elim1Store]: treesize reduction 58, result has 30.1 percent of original size [2022-11-25 22:45:26,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 76 [2022-11-25 22:45:26,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:45:26,511 INFO L321 Elim1Store]: treesize reduction 14, result has 65.0 percent of original size [2022-11-25 22:45:26,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2022-11-25 22:45:26,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 22:45:26,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-25 22:45:26,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:27,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:27,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:27,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:45:27,861 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-25 22:45:27,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 77 [2022-11-25 22:45:27,956 INFO L321 Elim1Store]: treesize reduction 35, result has 35.2 percent of original size [2022-11-25 22:45:27,956 INFO L350 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 2 case distinctions, treesize of input 28 treesize of output 33 [2022-11-25 22:45:28,072 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-25 22:45:28,072 INFO L350 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 2 case distinctions, treesize of input 50 treesize of output 61 [2022-11-25 22:45:28,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:28,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:28,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:28,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:45:28,566 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-25 22:45:28,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 77 [2022-11-25 22:45:28,671 INFO L321 Elim1Store]: treesize reduction 35, result has 35.2 percent of original size [2022-11-25 22:45:28,672 INFO L350 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 2 case distinctions, treesize of input 28 treesize of output 33 [2022-11-25 22:45:28,795 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-25 22:45:28,795 INFO L350 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 2 case distinctions, treesize of input 50 treesize of output 61 [2022-11-25 22:45:28,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:29,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:45:29,466 INFO L350 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 6 treesize of output 5 [2022-11-25 22:45:29,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:45:29,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:29,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:29,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:29,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:29,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:29,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:29,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:29,617 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:45:29,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:45:29,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:45:29,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:29,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:29,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:29,724 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:45:29,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:45:29,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:45:29,805 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:45:40,069 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4669#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_remove_first_~head#1.offset| 0) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_dll_remove_first_~head#1.base|) (<= 0 |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (<= 0 |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= |ULTIMATE.start_dll_remove_first_#in~head#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_dll_create_~data#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= 0 |ULTIMATE.start_dll_remove_first_~head#1.offset|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (not (<= (+ |ULTIMATE.start_dll_remove_first_#t~mem6#1.offset| 8) (select |#length| |ULTIMATE.start_dll_remove_first_#t~mem6#1.base|))) (not (<= 0 (+ |ULTIMATE.start_dll_remove_first_#t~mem6#1.offset| 4)))) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))' at error location [2022-11-25 22:45:40,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:45:40,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:45:40,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 51 [2022-11-25 22:45:40,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580909840] [2022-11-25 22:45:40,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:45:40,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 22:45:40,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:45:40,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 22:45:40,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=4055, Unknown=22, NotChecked=262, Total=4692 [2022-11-25 22:45:40,073 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 52 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 52 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) [2022-11-25 22:45:43,142 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse60 (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse24 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse95 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse433 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse434 (select (select .cse433 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse435 (+ .cse434 4))) (or (not (= (select (select (store .cse433 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse434 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse433 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse435) 4)) (= .cse435 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse269 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse430 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse431 (select (select .cse430 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse432 (+ .cse431 4))) (or (not (= (select (select (store .cse430 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse431 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse430 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse432) 4)) (= .cse432 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse268 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse428 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse429 (select (select .cse428 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse428 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse429 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse428 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse429 4)) 4))))))) (.cse94 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse426 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse427 (select (select .cse426 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse426 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse427 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse426 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse427 4)) 4))))))) (.cse3 (not .cse2))) (let ((.cse61 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse424 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse425 (select (select .cse424 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse424 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse425 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse424 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse425 4)) 4)))))) .cse3)) (.cse79 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse421 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse423 (select (select .cse421 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse422 (+ .cse423 4))) (or (<= 0 (+ (select (select .cse421 v_arrayElimCell_1044) .cse422) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse421 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse423 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse421 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse422) 4)) (= .cse422 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse62 (or .cse2 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse418 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse419 (select (select .cse418 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse420 (+ .cse419 4))) (or (not (= (select (select (store .cse418 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse419 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse418 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse420) 4)) (= .cse420 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse80 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse415 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse417 (select (select .cse415 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse416 (+ .cse417 4))) (or (<= 0 (+ (select (select .cse415 v_arrayElimCell_1044) .cse416) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse415 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse417 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse415 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse416) 4)) (= .cse416 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse63 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse412 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse414 (select (select .cse412 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse413 (+ .cse414 4))) (or (<= 0 (+ (select (select .cse412 v_arrayElimCell_1044) .cse413) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse412 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse414 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse412 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse413) 4))))))))) (.cse81 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse409 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse411 (select (select .cse409 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse410 (+ .cse411 4))) (or (<= 0 (+ (select (select .cse409 v_arrayElimCell_1044) .cse410) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse409 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse411 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse409 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse410) 4)) (= .cse410 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse82 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse406 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse408 (select (select .cse406 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse407 (+ .cse408 4))) (or (<= 0 (+ (select (select .cse406 v_arrayElimCell_1044) .cse407) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse406 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse408 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse406 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse407) 4))))))) .cse2)) (.cse64 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse404 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse405 (select (select .cse404 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse404 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse405 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse404 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse405 4)) 4)))))))) (.cse65 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse401 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse403 (select (select .cse401 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse402 (+ .cse403 4))) (or (<= 0 (+ (select (select .cse401 v_arrayElimCell_1044) .cse402) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse401 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse403 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse401 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse402) 4))))))))) (.cse83 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse398 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse400 (select (select .cse398 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse399 (+ .cse400 4))) (or (<= 0 (+ (select (select .cse398 v_arrayElimCell_1044) .cse399) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse398 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse400 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse398 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse399) 4))))))))) (.cse66 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse395 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse397 (select (select .cse395 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse396 (+ .cse397 4))) (or (<= 0 (+ (select (select .cse395 v_arrayElimCell_1044) .cse396) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse395 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse397 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse395 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse396) 4)) (= .cse396 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse67 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse392 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse394 (select (select .cse392 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse393 (+ .cse394 4))) (or (<= 0 (+ (select (select .cse392 v_arrayElimCell_1044) .cse393) 4)) (not (= (select (select (store .cse392 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse394 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse392 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse393) 4)) (= .cse393 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse68 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse389 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse391 (select (select .cse389 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse390 (+ .cse391 4))) (or (<= 0 (+ (select (select .cse389 v_arrayElimCell_1044) .cse390) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse389 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse391 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse389 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse390) 4)) (= .cse390 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse84 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse386 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse388 (select (select .cse386 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse387 (+ .cse388 4))) (or (<= 0 (+ (select (select .cse386 v_arrayElimCell_1044) .cse387) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse386 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse388 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse386 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse387) 4))))))))) (.cse69 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse383 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse385 (select (select .cse383 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse384 (+ .cse385 4))) (or (<= 0 (+ (select (select .cse383 v_arrayElimCell_1044) .cse384) 4)) (not (= (select (select (store .cse383 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse385 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse383 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse384) 4)) (= .cse384 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse70 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse380 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse382 (select (select .cse380 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse381 (+ .cse382 4))) (or (<= 0 (+ (select (select .cse380 v_arrayElimCell_1044) .cse381) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse380 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse382 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse380 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse381) 4))))))))) (.cse71 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse377 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse379 (select (select .cse377 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse378 (+ .cse379 4))) (or (<= 0 (+ (select (select .cse377 v_arrayElimCell_1044) .cse378) 4)) (not (= (select (select (store .cse377 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse379 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse377 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse378) 4))))))))) (.cse72 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse374 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse376 (select (select .cse374 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse375 (+ .cse376 4))) (or (<= 0 (+ (select (select .cse374 v_arrayElimCell_1044) .cse375) 4)) (not (= (select (select (store .cse374 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse376 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse374 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse375) 4)) (= .cse375 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse85 (or .cse2 .cse94)) (.cse73 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse371 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse373 (select (select .cse371 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse372 (+ .cse373 4))) (or (<= 0 (+ (select (select .cse371 v_arrayElimCell_1044) .cse372) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse371 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse373 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse371 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse372) 4)) (= .cse372 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse74 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse368 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse369 (select (select .cse368 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse370 (+ .cse369 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse368 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse369 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse368 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse370) 4)) (= .cse370 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse75 (or .cse2 .cse268)) (.cse86 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse365 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse367 (select (select .cse365 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse366 (+ .cse367 4))) (or (<= 0 (+ (select (select .cse365 v_arrayElimCell_1044) .cse366) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse365 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse367 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse365 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse366) 4))))))) .cse3)) (.cse76 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse363 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse364 (select (select .cse363 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse363 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse364 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse363 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse364 4)) 4)))))))) (.cse77 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse360 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse361 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse362 (+ .cse361 4))) (or (not (= (select (select (store .cse360 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse361 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse360 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse362) 4)) (= .cse362 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse78 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse357 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse359 (select (select .cse357 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse358 (+ .cse359 4))) (or (<= 0 (+ (select (select .cse357 v_arrayElimCell_1044) .cse358) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse357 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse359 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse357 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse358) 4)) (= .cse358 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse87 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse354 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse356 (select (select .cse354 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse355 (+ .cse356 4))) (or (<= 0 (+ (select (select .cse354 v_arrayElimCell_1044) .cse355) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse354 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse356 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse354 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse355) 4))))))) .cse3)) (.cse88 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse351 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse353 (select (select .cse351 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse352 (+ .cse353 4))) (or (<= 0 (+ (select (select .cse351 v_arrayElimCell_1044) .cse352) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse351 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse353 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse351 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse352) 4)) (= .cse352 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse89 (or .cse269 .cse2)) (.cse90 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse349 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse350 (select (select .cse349 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse349 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse350 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse349 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse350 4)) 4)))))))) (.cse91 (or .cse2 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse347 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse348 (select (select .cse347 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse347 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse348 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse347 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse348 4)) 4)))))))) (.cse92 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse344 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse346 (select (select .cse344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse345 (+ .cse346 4))) (or (<= 0 (+ (select (select .cse344 v_arrayElimCell_1044) .cse345) 4)) (not (= (select (select (store .cse344 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse346 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse344 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse345) 4)) (= .cse345 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse93 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse341 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse343 (select (select .cse341 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse342 (+ .cse343 4))) (or (<= 0 (+ (select (select .cse341 v_arrayElimCell_1044) .cse342) 4)) (not (= (select (select (store .cse341 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse343 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse341 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse342) 4))))))) .cse3)) (.cse29 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse338 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse339 (select (select .cse338 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse340 (+ .cse339 4))) (or (not (= (select (select (store .cse338 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse339 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse338 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse340) 4)) (= .cse340 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse49 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse335 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse337 (select (select .cse335 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse336 (+ .cse337 4))) (or (<= 0 (+ (select (select .cse335 v_arrayElimIndex_40) .cse336) 4)) (not (= (select (select (store .cse335 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse337 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse335 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse336) 4)) (= .cse336 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse1 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse333 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse334 (select (select .cse333 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse333 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse334 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse333 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse334 4)) 4))))))) (.cse25 (forall ((v_arrayElimIndex_40 Int)) (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse330 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse332 (select (select .cse330 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse331 (+ .cse332 4))) (or (<= 0 (+ (select (select .cse330 v_arrayElimIndex_40) .cse331) 4)) (not (= (select (select (store .cse330 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse332 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse330 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse331) 4)) (= .cse331 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (.cse26 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse327 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse329 (select (select .cse327 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse328 (+ .cse329 4))) (or (<= 0 (+ (select (select .cse327 v_arrayElimIndex_40) .cse328) 4)) (not (= (select (select (store .cse327 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse329 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse327 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse328) 4)) (= .cse328 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (.cse50 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse324 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse326 (select (select .cse324 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse325 (+ .cse326 4))) (or (<= 0 (+ (select (select .cse324 v_arrayElimIndex_40) .cse325) 4)) (not (= (select (select (store .cse324 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse326 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse324 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse325) 4)))))))))) (.cse58 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse321 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse322 (select (select .cse321 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse323 (+ .cse322 4))) (or (not (= (select (select (store .cse321 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse322 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse321 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse323) 4)) (= .cse323 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse54 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse318 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse320 (select (select .cse318 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse319 (+ .cse320 4))) (or (<= 0 (+ (select (select .cse318 v_arrayElimIndex_40) .cse319) 4)) (not (= (select (select (store .cse318 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse320 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse318 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse319) 4)) (= .cse319 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse12 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse315 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse317 (select (select .cse315 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse316 (+ .cse317 4))) (or (<= 0 (+ (select (select .cse315 v_arrayElimIndex_40) .cse316) 4)) (not (= (select (select (store .cse315 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse317 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse315 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse316) 4)) (= .cse316 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse16 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse312 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse314 (select (select .cse312 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse313 (+ .cse314 4))) (or (<= 0 (+ (select (select .cse312 v_arrayElimIndex_40) .cse313) 4)) (not (= (select (select (store .cse312 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse314 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse312 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse313) 4)) (= .cse313 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse8 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse309 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse311 (select (select .cse309 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse310 (+ .cse311 4))) (or (<= 0 (+ (select (select .cse309 v_arrayElimIndex_40) .cse310) 4)) (not (= (select (select (store .cse309 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse311 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse309 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse310) 4)))))))) (.cse27 (forall ((v_arrayElimIndex_40 Int)) (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse306 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse308 (select (select .cse306 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse307 (+ .cse308 4))) (or (<= 0 (+ (select (select .cse306 v_arrayElimIndex_40) .cse307) 4)) (not (= (select (select (store .cse306 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse308 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse306 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse307) 4))))))) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (.cse28 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse303 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse305 (select (select .cse303 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse304 (+ .cse305 4))) (or (<= 0 (+ (select (select .cse303 v_arrayElimIndex_40) .cse304) 4)) (not (= (select (select (store .cse303 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse305 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse303 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse304) 4)))))))))) (.cse57 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse300 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse302 (select (select .cse300 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse301 (+ .cse302 4))) (or (<= 0 (+ (select (select .cse300 v_arrayElimIndex_40) .cse301) 4)) (not (= (select (select (store .cse300 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse302 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse300 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse301) 4)))))))) (.cse34 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse297 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse298 (select (select .cse297 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse299 (+ .cse298 4))) (or (not (= (select (select (store .cse297 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse298 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse297 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse299) 4)) (= .cse299 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse40 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse294 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse296 (select (select .cse294 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse295 (+ .cse296 4))) (or (<= 0 (+ (select (select .cse294 v_arrayElimIndex_40) .cse295) 4)) (not (= (select (select (store .cse294 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse296 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse294 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse295) 4)))))))) (.cse35 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse292 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse293 (select (select .cse292 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse292 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse293 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse292 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse293 4)) 4))))))) (.cse55 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse290 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse291 (select (select .cse290 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse290 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse291 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse290 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse291 4)) 4))))))) (.cse45 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse287 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse289 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse288 (+ .cse289 4))) (or (<= 0 (+ (select (select .cse287 v_arrayElimIndex_40) .cse288) 4)) (not (= (select (select (store .cse287 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse289 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse287 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse288) 4)) (= .cse288 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse51 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse284 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse286 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse285 (+ .cse286 4))) (or (<= 0 (+ (select (select .cse284 v_arrayElimIndex_40) .cse285) 4)) (not (= (select (select (store .cse284 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse286 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse284 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse285) 4)))))))) (.cse52 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse281 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse283 (select (select .cse281 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse282 (+ .cse283 4))) (or (<= 0 (+ (select (select .cse281 v_arrayElimIndex_40) .cse282) 4)) (not (= (select (select (store .cse281 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse283 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse281 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse282) 4)) (= .cse282 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (.cse36 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse278 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse279 (select (select .cse278 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse280 (+ .cse279 4))) (or (not (= (select (select (store .cse278 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse279 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse278 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse280) 4)) (= .cse280 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse44 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse275 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse277 (select (select .cse275 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse276 (+ .cse277 4))) (or (<= 0 (+ (select (select .cse275 v_arrayElimIndex_40) .cse276) 4)) (not (= (select (select (store .cse275 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse277 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse275 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse276) 4)) (= .cse276 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse53 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse273 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse274 (select (select .cse273 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse273 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse274 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse273 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse274 4)) 4))))))) (.cse47 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse270 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse272 (select (select .cse270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse271 (+ .cse272 4))) (or (<= 0 (+ (select (select .cse270 v_arrayElimIndex_40) .cse271) 4)) (not (= (select (select (store .cse270 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse272 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse270 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse271) 4)) (= .cse271 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse217 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (.cse23 (or .cse269 .cse3)) (.cse33 (or .cse2 .cse95)) (.cse46 (or .cse268 .cse3)) (.cse48 (or (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse265 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse266 (select (select .cse265 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse267 (+ .cse266 4))) (or (not (= (select (select (store .cse265 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse266 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse265 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse267) 4)) (= .cse267 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse56 (or .cse24 (and .cse94 .cse95))) (.cse59 (not .cse60)) (.cse152 (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (and (or (and (or .cse1 .cse2) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (+ .cse6 4))) (or (<= 0 (+ (select (select .cse4 v_arrayElimIndex_40) .cse5) 4)) (not (= (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5) 4)))))))) (or .cse2 .cse8) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse11 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ .cse11 4))) (or (<= 0 (+ (select (select .cse9 v_arrayElimIndex_40) .cse10) 4)) (not (= (select (select (store .cse9 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10) 4)) (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or .cse2 .cse12) (or (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse15 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (+ .cse15 4))) (or (<= 0 (+ (select (select .cse13 v_arrayElimIndex_40) .cse14) 4)) (not (= (select (select (store .cse13 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse14) 4)) (= .cse14 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse16) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse19 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (+ .cse19 4))) (or (<= 0 (+ (select (select .cse17 v_arrayElimIndex_40) .cse18) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= (select (select (store .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse18) 4)) (= .cse18 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse22 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (+ .cse22 4))) (or (<= 0 (+ (select (select .cse20 v_arrayElimIndex_40) .cse21) 4)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse21) 4))))))) .cse3) .cse23 (or .cse24 (and .cse25 .cse26 .cse27 .cse28)) (or .cse29 .cse2) (or .cse3 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse32 (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse31 (+ .cse32 4))) (or (<= 0 (+ (select (select .cse30 v_arrayElimIndex_40) .cse31) 4)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse31) 4)) (= .cse31 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse33 (or .cse2 .cse34) (or .cse24 (and .cse35 .cse36)) (or (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse39 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse38 (+ .cse39 4))) (or (<= 0 (+ (select (select .cse37 v_arrayElimIndex_40) .cse38) 4)) (not (= (select (select (store .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse38) 4)) (= .cse38 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse40) (or (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse43 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (+ .cse43 4))) (or (<= 0 (+ (select (select .cse41 v_arrayElimIndex_40) .cse42) 4)) (not (= (select (select (store .cse41 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse42) 4)) (= .cse42 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse44) (or .cse2 .cse45) .cse46 (or .cse2 .cse47) .cse48 (or .cse24 (and .cse49 .cse50 .cse51 .cse52)) (or .cse2 .cse53) (or .cse2 .cse54) (or .cse2 .cse55) .cse56 (or .cse2 .cse57) (or .cse2 .cse58)) .cse59) (or .cse60 (and .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 (or .cse24 (and .cse61 .cse79 .cse62 .cse80 .cse81 .cse82 .cse64 .cse65 .cse83 .cse66 .cse67 .cse84 .cse69 .cse71 .cse72 .cse33 .cse85 .cse73 .cse74 .cse75 .cse86 .cse76 .cse77 .cse87 .cse88 .cse89 .cse48 .cse90 .cse91 .cse92 .cse93)) .cse87 .cse89 .cse48 .cse90 .cse92 .cse93)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or .cse24 (and (or .cse60 (and .cse61 .cse79 .cse62 .cse80 .cse63 .cse81 .cse82 .cse64 .cse65 .cse83 .cse66 .cse67 .cse68 .cse84 .cse69 .cse70 .cse71 .cse72 .cse33 .cse85 .cse73 .cse74 .cse75 .cse86 .cse76 .cse77 .cse78 .cse87 .cse88 .cse89 .cse48 .cse90 .cse91 .cse92 .cse93)) (or (and .cse29 .cse49 .cse1 .cse25 .cse26 .cse50 .cse94 .cse58 .cse54 .cse12 .cse16 .cse8 .cse27 .cse28 .cse57 .cse34 .cse40 .cse35 .cse55 .cse45 .cse51 .cse52 .cse36 .cse95 .cse44 .cse53 .cse47) .cse59))) (= (select .cse7 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) .cse3 (or .cse60 (let ((.cse99 (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse115 (not .cse99))) (let ((.cse100 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse214 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse216 (select (select .cse214 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse215 (+ .cse216 4))) (or (<= 0 (+ (select (select .cse214 v_arrayElimCell_1044) .cse215) 4)) (<= 0 (+ (select (select .cse214 0) .cse215) 4)) (not (= .cse216 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse215 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse214 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (.cse101 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse211 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse213 (select (select .cse211 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse212 (+ .cse213 4))) (or (<= 0 (+ (select (select .cse211 v_arrayElimCell_1044) .cse212) 4)) (<= 0 (+ (select (select .cse211 0) .cse212) 4)) (not (= (select (select (store .cse211 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse213 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse115)) (.cse102 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse209 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse210 (select (select .cse209 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse209 0) (+ .cse210 4)) 4)) (not (= (select (select (store .cse209 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse210 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (.cse103 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse207 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse208 (select (select .cse207 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse207 0) (+ .cse208 4)) 4)) (not (= (select (select (store .cse207 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse208 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115)) (.cse104 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse204 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse206 (select (select .cse204 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse205 (+ .cse206 4))) (or (<= 0 (+ (select (select .cse204 v_arrayElimCell_1044) .cse205) 4)) (<= 0 (+ (select (select .cse204 0) .cse205) 4)) (not (= (select (select (store .cse204 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse206 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse205 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse111 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse201 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse203 (select (select .cse201 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse202 (+ .cse203 4))) (or (<= 0 (+ (select (select .cse201 0) .cse202) 4)) (not (= (select (select (store .cse201 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse203 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse202 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse114 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse198 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse200 (select (select .cse198 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse199 (+ .cse200 4))) (or (<= 0 (+ (select (select .cse198 v_arrayElimCell_1044) .cse199) 4)) (<= 0 (+ (select (select .cse198 0) .cse199) 4)) (not (= (select (select (store .cse198 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse200 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse199 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse122 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse195 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse197 (select (select .cse195 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse196 (+ .cse197 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse195 0) .cse196) 4)) (not (= (select (select (store .cse195 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse197 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse196 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse123 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse192 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse194 (select (select .cse192 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse193 (+ .cse194 4))) (or (<= 0 (+ (select (select .cse192 v_arrayElimCell_1044) .cse193) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse192 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse192 0) .cse193) 4)) (not (= .cse194 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse193 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse127 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse189 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse191 (select (select .cse189 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse190 (+ .cse191 4))) (or (<= 0 (+ (select (select .cse189 0) .cse190) 4)) (not (= .cse191 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse190 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse189 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99)) (.cse128 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse187 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse188 (select (select .cse187 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse187 0) (+ .cse188 4)) 4)) (not (= .cse188 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse187 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse131 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse184 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse186 (select (select .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse185 (+ .cse186 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse184 v_arrayElimCell_1044) .cse185) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse184 0) .cse185) 4)) (not (= (select (select (store .cse184 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse186 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (.cse132 (or .cse115 (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse181 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse183 (select (select .cse181 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse182 (+ .cse183 4))) (or (not (= (select (select (store .cse181 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse181 0) .cse182) 4)) (not (= .cse183 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse182 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse136 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse178 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse180 (select (select .cse178 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse179 (+ .cse180 4))) (or (<= 0 (+ (select (select .cse178 v_arrayElimCell_1044) .cse179) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse178 0) .cse179) 4)) (not (= (select (select (store .cse178 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse180 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse115)) (.cse137 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse176 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse177 (select (select .cse176 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse176 0) (+ .cse177 4)) 4)) (not (= (select (select (store .cse176 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse177 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115)) (.cse138 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse173 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse175 (select (select .cse173 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse174 (+ .cse175 4))) (or (<= 0 (+ (select (select .cse173 v_arrayElimCell_1044) .cse174) 4)) (not (= (select (select (store .cse173 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse173 0) .cse174) 4)) (not (= .cse175 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse174 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse145 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse170 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse172 (select (select .cse170 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse171 (+ .cse172 4))) (or (<= 0 (+ (select (select .cse170 0) .cse171) 4)) (not (= (select (select (store .cse170 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse172 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse171 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse146 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse167 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse169 (select (select .cse167 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse168 (+ .cse169 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse167 v_arrayElimCell_1044) .cse168) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse167 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse167 0) .cse168) 4)) (not (= .cse169 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse168 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse147 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse164 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse166 (select (select .cse164 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse165 (+ .cse166 4))) (or (<= 0 (+ (select (select .cse164 v_arrayElimCell_1044) .cse165) 4)) (<= 0 (+ (select (select .cse164 0) .cse165) 4)) (not (= .cse166 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse164 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99)) (.cse151 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse162 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse163 (select (select .cse162 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 0) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse162 0) (+ .cse163 4)) 4)) (not (= (select (select (store .cse162 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse163 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115))) (and (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse96 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse98 (select (select .cse96 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse97 (+ .cse98 4))) (or (<= 0 (+ (select (select .cse96 v_arrayElimCell_1044) .cse97) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse96 0) .cse97) 4)) (not (= .cse98 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse96 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse100 .cse101 .cse102 .cse103 .cse104 (or (and .cse100 .cse101 .cse102 .cse103 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse105 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse107 (select (select .cse105 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse106 (+ .cse107 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse105 v_arrayElimCell_1044) .cse106) 4)) (<= 0 (+ (select (select .cse105 0) .cse106) 4)) (not (= (select (select (store .cse105 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse107 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse106 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse108 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse110 (select (select .cse108 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse109 (+ .cse110 4))) (or (not (= (select (select (store .cse108 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse108 0) .cse109) 4)) (not (= .cse110 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse109 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse104 .cse111 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse112 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse113 (select (select .cse112 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse112 0) (+ .cse113 4)) 4)) (not (= (select (select (store .cse112 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse113 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse99) .cse114 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse116 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse118 (select (select .cse116 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse117 (+ .cse118 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse116 v_arrayElimCell_1044) .cse117) 4)) (<= 0 (+ (select (select .cse116 0) .cse117) 4)) (not (= (select (select (store .cse116 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse118 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse119 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse121 (select (select .cse119 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse120 (+ .cse121 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse119 v_arrayElimCell_1044) .cse120) 4)) (not (= (select (select (store .cse119 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse119 0) .cse120) 4)) (not (= .cse121 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse120 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse122 .cse123 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse124 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse126 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse125 (+ .cse126 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse124 v_arrayElimCell_1044) .cse125) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse124 0) .cse125) 4)) (not (= (select (select (store .cse124 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse126 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse125 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse99) .cse127 .cse128 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse129 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse130 (select (select .cse129 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse129 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse129 0) (+ .cse130 4)) 4)) (not (= .cse130 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse131 .cse132 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse133 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse135 (select (select .cse133 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse134 (+ .cse135 4))) (or (<= 0 (+ (select (select .cse133 v_arrayElimCell_1044) .cse134) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse133 0) .cse134) 4)) (not (= (select (select (store .cse133 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse135 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) .cse136 .cse137 .cse138 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse139 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse141 (select (select .cse139 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse140 (+ .cse141 4))) (or (<= 0 (+ (select (select .cse139 v_arrayElimCell_1044) .cse140) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse139 0) .cse140) 4)) (not (= (select (select (store .cse139 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse141 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse140 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse99) (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse142 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse144 (select (select .cse142 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse143 (+ .cse144 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse142 v_arrayElimCell_1044) .cse143) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse142 0) .cse143) 4)) (not (= (select (select (store .cse142 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse144 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse99) .cse145 .cse146 .cse147 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse148 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse150 (select (select .cse148 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse149 (+ .cse150 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse148 v_arrayElimCell_1044) .cse149) 4)) (<= 0 (+ (select (select .cse148 0) .cse149) 4)) (not (= (select (select (store .cse148 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse150 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) .cse151) .cse152) .cse111 .cse114 .cse122 .cse123 .cse127 .cse128 .cse131 .cse132 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse153 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse155 (select (select .cse153 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse154 (+ .cse155 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse153 v_arrayElimCell_1044) .cse154) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse153 0) .cse154) 4)) (not (= .cse155 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse153 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse136 .cse137 .cse138 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse156 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse158 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse157 (+ .cse158 4))) (or (<= 0 (+ (select (select .cse156 v_arrayElimCell_1044) .cse157) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse156 0) .cse157) 4)) (not (= .cse158 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse157 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse156 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) .cse145 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse159 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse161 (select (select .cse159 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse160 (+ .cse161 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse159 v_arrayElimCell_1044) .cse160) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse159 0) .cse160) 4)) (not (= .cse161 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse160 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse159 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse146 .cse147 .cse151)))) (not .cse217)) (or (let ((.cse222 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse263 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse262 (select (select .cse263 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse264 (+ .cse262 4))) (or (not (= .cse262 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse263 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse264) 4)) (= .cse264 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse263 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse221 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse261 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse260 (select (select .cse261 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse260 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse261 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse260 4)) 4)) (not (= (select (select (store .cse261 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (let ((.cse241 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse257 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse259 (select (select .cse257 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse258 (+ .cse259 4))) (or (not (= (select (select (store .cse257 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse257 0) .cse258) 4)) (not (= .cse259 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse257 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse258) 4)) (= .cse258 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse219 (or .cse221 .cse2)) (.cse223 (or .cse2 .cse222)) (.cse236 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse254 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse256 (select (select .cse254 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse255 (+ .cse256 4))) (or (<= 0 (+ (select (select .cse254 0) .cse255) 4)) (not (= .cse256 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse254 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse255) 4)) (not (= (select (select (store .cse254 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse237 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse251 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse253 (select (select .cse251 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse252 (+ .cse253 4))) (or (<= 0 (+ (select (select .cse251 0) .cse252) 4)) (not (= .cse253 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse251 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse252) 4)) (= .cse252 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse251 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (let ((.cse220 (or .cse3 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse248 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse250 (select (select .cse248 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse249 (+ .cse250 4))) (or (<= 0 (+ (select (select .cse248 0) .cse249) 4)) (not (= (select (select (store .cse248 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse250 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse248 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse249) 4)) (= .cse249 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse224 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse245 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse247 (select (select .cse245 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse246 (+ .cse247 4))) (or (<= 0 (+ (select (select .cse245 0) .cse246) 4)) (not (= (select (select (store .cse245 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse247 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse245 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse246) 4))))))) .cse3)) (.cse225 (or .cse2 .cse237)) (.cse227 (or .cse2 .cse236)) (.cse218 (and .cse23 .cse219 .cse33 .cse223 .cse46 .cse48 .cse56)) (.cse228 (or .cse217 (and .cse241 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse242 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse244 (select (select .cse242 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse243 (+ .cse244 4))) (or (not (= (select (select (store .cse242 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse242 0) .cse243) 4)) (not (= .cse244 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse242 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse243) 4)))))))))) (.cse226 (or .cse2 .cse241)) (.cse235 (or (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse238 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse240 (select (select .cse238 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse239 (+ .cse240 4))) (or (not (= (select (select (store .cse238 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse238 0) .cse239) 4)) (not (= .cse240 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse238 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse239) 4)) (= .cse239 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3))) (and (or .cse217 .cse218) .cse23 .cse219 .cse220 .cse33 (or .cse24 (and .cse221 .cse222)) .cse223 .cse224 .cse225 (or .cse217 (and .cse220 .cse226)) .cse227 (or (and (or .cse24 (and .cse228 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse229 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse231 (select (select .cse229 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse230 (+ .cse231 4))) (or (<= 0 (+ (select (select .cse229 0) .cse230) 4)) (not (= (select (select (store .cse229 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse231 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse229 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse230) 4)) (= .cse230 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse232 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse234 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse233 (+ .cse234 4))) (or (<= 0 (+ (select (select .cse232 0) .cse233) 4)) (not (= (select (select (store .cse232 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse234 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse232 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse233) 4))))))))) .cse220 .cse224 .cse225 .cse227 .cse226 (or (and .cse224 .cse225 .cse227 .cse235) .cse217) .cse235) .cse152) (or .cse218 .cse152) (or .cse24 (and .cse228 .cse236 .cse237)) .cse226 .cse46 (or .cse217 (and .cse226 .cse235)) .cse48 .cse235)))) .cse59) (not .cse152) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from true [2022-11-25 22:45:46,778 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse60 (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse24 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse95 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse433 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse434 (select (select .cse433 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse435 (+ .cse434 4))) (or (not (= (select (select (store .cse433 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse434 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse433 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse435) 4)) (= .cse435 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse269 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse430 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse431 (select (select .cse430 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse432 (+ .cse431 4))) (or (not (= (select (select (store .cse430 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse431 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse430 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse432) 4)) (= .cse432 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse268 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse428 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse429 (select (select .cse428 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse428 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse429 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse428 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse429 4)) 4))))))) (.cse94 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse426 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse427 (select (select .cse426 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse426 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse427 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse426 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse427 4)) 4))))))) (.cse3 (not .cse2))) (let ((.cse61 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse424 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse425 (select (select .cse424 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse424 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse425 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse424 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse425 4)) 4)))))) .cse3)) (.cse79 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse421 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse423 (select (select .cse421 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse422 (+ .cse423 4))) (or (<= 0 (+ (select (select .cse421 v_arrayElimCell_1044) .cse422) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse421 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse423 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse421 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse422) 4)) (= .cse422 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse62 (or .cse2 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse418 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse419 (select (select .cse418 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse420 (+ .cse419 4))) (or (not (= (select (select (store .cse418 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse419 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse418 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse420) 4)) (= .cse420 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse80 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse415 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse417 (select (select .cse415 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse416 (+ .cse417 4))) (or (<= 0 (+ (select (select .cse415 v_arrayElimCell_1044) .cse416) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse415 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse417 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse415 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse416) 4)) (= .cse416 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse63 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse412 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse414 (select (select .cse412 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse413 (+ .cse414 4))) (or (<= 0 (+ (select (select .cse412 v_arrayElimCell_1044) .cse413) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse412 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse414 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse412 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse413) 4))))))))) (.cse81 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse409 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse411 (select (select .cse409 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse410 (+ .cse411 4))) (or (<= 0 (+ (select (select .cse409 v_arrayElimCell_1044) .cse410) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse409 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse411 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse409 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse410) 4)) (= .cse410 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse82 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse406 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse408 (select (select .cse406 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse407 (+ .cse408 4))) (or (<= 0 (+ (select (select .cse406 v_arrayElimCell_1044) .cse407) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse406 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse408 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse406 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse407) 4))))))) .cse2)) (.cse64 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse404 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse405 (select (select .cse404 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse404 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse405 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse404 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse405 4)) 4)))))))) (.cse65 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse401 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse403 (select (select .cse401 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse402 (+ .cse403 4))) (or (<= 0 (+ (select (select .cse401 v_arrayElimCell_1044) .cse402) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse401 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse403 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse401 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse402) 4))))))))) (.cse83 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse398 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse400 (select (select .cse398 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse399 (+ .cse400 4))) (or (<= 0 (+ (select (select .cse398 v_arrayElimCell_1044) .cse399) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse398 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse400 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse398 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse399) 4))))))))) (.cse66 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse395 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse397 (select (select .cse395 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse396 (+ .cse397 4))) (or (<= 0 (+ (select (select .cse395 v_arrayElimCell_1044) .cse396) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse395 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse397 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse395 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse396) 4)) (= .cse396 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse67 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse392 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse394 (select (select .cse392 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse393 (+ .cse394 4))) (or (<= 0 (+ (select (select .cse392 v_arrayElimCell_1044) .cse393) 4)) (not (= (select (select (store .cse392 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse394 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse392 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse393) 4)) (= .cse393 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse68 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse389 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse391 (select (select .cse389 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse390 (+ .cse391 4))) (or (<= 0 (+ (select (select .cse389 v_arrayElimCell_1044) .cse390) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse389 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse391 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse389 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse390) 4)) (= .cse390 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse84 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse386 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse388 (select (select .cse386 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse387 (+ .cse388 4))) (or (<= 0 (+ (select (select .cse386 v_arrayElimCell_1044) .cse387) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse386 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse388 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse386 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse387) 4))))))))) (.cse69 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse383 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse385 (select (select .cse383 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse384 (+ .cse385 4))) (or (<= 0 (+ (select (select .cse383 v_arrayElimCell_1044) .cse384) 4)) (not (= (select (select (store .cse383 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse385 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse383 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse384) 4)) (= .cse384 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse70 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse380 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse382 (select (select .cse380 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse381 (+ .cse382 4))) (or (<= 0 (+ (select (select .cse380 v_arrayElimCell_1044) .cse381) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse380 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse382 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse380 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse381) 4))))))))) (.cse71 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse377 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse379 (select (select .cse377 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse378 (+ .cse379 4))) (or (<= 0 (+ (select (select .cse377 v_arrayElimCell_1044) .cse378) 4)) (not (= (select (select (store .cse377 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse379 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse377 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse378) 4))))))))) (.cse72 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse374 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse376 (select (select .cse374 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse375 (+ .cse376 4))) (or (<= 0 (+ (select (select .cse374 v_arrayElimCell_1044) .cse375) 4)) (not (= (select (select (store .cse374 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse376 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse374 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse375) 4)) (= .cse375 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse85 (or .cse2 .cse94)) (.cse73 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse371 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse373 (select (select .cse371 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse372 (+ .cse373 4))) (or (<= 0 (+ (select (select .cse371 v_arrayElimCell_1044) .cse372) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse371 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse373 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse371 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse372) 4)) (= .cse372 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse74 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse368 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse369 (select (select .cse368 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse370 (+ .cse369 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse368 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse369 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse368 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse370) 4)) (= .cse370 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse75 (or .cse2 .cse268)) (.cse86 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse365 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse367 (select (select .cse365 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse366 (+ .cse367 4))) (or (<= 0 (+ (select (select .cse365 v_arrayElimCell_1044) .cse366) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse365 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse367 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse365 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse366) 4))))))) .cse3)) (.cse76 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse363 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse364 (select (select .cse363 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse363 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse364 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse363 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse364 4)) 4)))))))) (.cse77 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse360 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse361 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse362 (+ .cse361 4))) (or (not (= (select (select (store .cse360 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse361 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse360 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse362) 4)) (= .cse362 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse78 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse357 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse359 (select (select .cse357 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse358 (+ .cse359 4))) (or (<= 0 (+ (select (select .cse357 v_arrayElimCell_1044) .cse358) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse357 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse359 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse357 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse358) 4)) (= .cse358 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse87 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse354 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse356 (select (select .cse354 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse355 (+ .cse356 4))) (or (<= 0 (+ (select (select .cse354 v_arrayElimCell_1044) .cse355) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse354 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse356 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse354 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse355) 4))))))) .cse3)) (.cse88 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse351 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse353 (select (select .cse351 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse352 (+ .cse353 4))) (or (<= 0 (+ (select (select .cse351 v_arrayElimCell_1044) .cse352) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse351 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse353 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse351 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse352) 4)) (= .cse352 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse89 (or .cse269 .cse2)) (.cse90 (or .cse3 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse349 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse350 (select (select .cse349 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimCell_1044) (not (= (select (select (store .cse349 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse350 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse349 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse350 4)) 4)))))))) (.cse91 (or .cse2 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse347 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse348 (select (select .cse347 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse347 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse348 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse347 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse348 4)) 4)))))))) (.cse92 (or .cse2 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse344 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse346 (select (select .cse344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse345 (+ .cse346 4))) (or (<= 0 (+ (select (select .cse344 v_arrayElimCell_1044) .cse345) 4)) (not (= (select (select (store .cse344 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse346 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse344 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse345) 4)) (= .cse345 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse93 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse341 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse343 (select (select .cse341 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse342 (+ .cse343 4))) (or (<= 0 (+ (select (select .cse341 v_arrayElimCell_1044) .cse342) 4)) (not (= (select (select (store .cse341 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse343 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse341 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse342) 4))))))) .cse3)) (.cse29 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse338 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse339 (select (select .cse338 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse340 (+ .cse339 4))) (or (not (= (select (select (store .cse338 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse339 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse338 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse340) 4)) (= .cse340 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse49 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse335 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse337 (select (select .cse335 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse336 (+ .cse337 4))) (or (<= 0 (+ (select (select .cse335 v_arrayElimIndex_40) .cse336) 4)) (not (= (select (select (store .cse335 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse337 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse335 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse336) 4)) (= .cse336 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse1 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse333 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse334 (select (select .cse333 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse333 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse334 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse333 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse334 4)) 4))))))) (.cse25 (forall ((v_arrayElimIndex_40 Int)) (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse330 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse332 (select (select .cse330 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse331 (+ .cse332 4))) (or (<= 0 (+ (select (select .cse330 v_arrayElimIndex_40) .cse331) 4)) (not (= (select (select (store .cse330 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse332 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse330 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse331) 4)) (= .cse331 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (.cse26 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse327 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse329 (select (select .cse327 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse328 (+ .cse329 4))) (or (<= 0 (+ (select (select .cse327 v_arrayElimIndex_40) .cse328) 4)) (not (= (select (select (store .cse327 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse329 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse327 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse328) 4)) (= .cse328 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (.cse50 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse324 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse326 (select (select .cse324 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse325 (+ .cse326 4))) (or (<= 0 (+ (select (select .cse324 v_arrayElimIndex_40) .cse325) 4)) (not (= (select (select (store .cse324 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse326 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse324 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse325) 4)))))))))) (.cse58 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse321 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse322 (select (select .cse321 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse323 (+ .cse322 4))) (or (not (= (select (select (store .cse321 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse322 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse321 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse323) 4)) (= .cse323 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse54 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse318 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse320 (select (select .cse318 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse319 (+ .cse320 4))) (or (<= 0 (+ (select (select .cse318 v_arrayElimIndex_40) .cse319) 4)) (not (= (select (select (store .cse318 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse320 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse318 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse319) 4)) (= .cse319 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse12 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse315 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse317 (select (select .cse315 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse316 (+ .cse317 4))) (or (<= 0 (+ (select (select .cse315 v_arrayElimIndex_40) .cse316) 4)) (not (= (select (select (store .cse315 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse317 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse315 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse316) 4)) (= .cse316 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse16 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse312 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse314 (select (select .cse312 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse313 (+ .cse314 4))) (or (<= 0 (+ (select (select .cse312 v_arrayElimIndex_40) .cse313) 4)) (not (= (select (select (store .cse312 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse314 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse312 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse313) 4)) (= .cse313 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse8 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse309 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse311 (select (select .cse309 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse310 (+ .cse311 4))) (or (<= 0 (+ (select (select .cse309 v_arrayElimIndex_40) .cse310) 4)) (not (= (select (select (store .cse309 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse311 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse309 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse310) 4)))))))) (.cse27 (forall ((v_arrayElimIndex_40 Int)) (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse306 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse308 (select (select .cse306 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse307 (+ .cse308 4))) (or (<= 0 (+ (select (select .cse306 v_arrayElimIndex_40) .cse307) 4)) (not (= (select (select (store .cse306 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse308 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse306 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse307) 4))))))) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (.cse28 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse303 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse305 (select (select .cse303 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse304 (+ .cse305 4))) (or (<= 0 (+ (select (select .cse303 v_arrayElimIndex_40) .cse304) 4)) (not (= (select (select (store .cse303 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse305 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse303 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse304) 4)))))))))) (.cse57 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse300 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse302 (select (select .cse300 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse301 (+ .cse302 4))) (or (<= 0 (+ (select (select .cse300 v_arrayElimIndex_40) .cse301) 4)) (not (= (select (select (store .cse300 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse302 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse300 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse301) 4)))))))) (.cse34 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse297 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse298 (select (select .cse297 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse299 (+ .cse298 4))) (or (not (= (select (select (store .cse297 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse298 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse297 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse299) 4)) (= .cse299 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse40 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse294 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse296 (select (select .cse294 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse295 (+ .cse296 4))) (or (<= 0 (+ (select (select .cse294 v_arrayElimIndex_40) .cse295) 4)) (not (= (select (select (store .cse294 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse296 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse294 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse295) 4)))))))) (.cse35 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse292 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse293 (select (select .cse292 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse292 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse293 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse292 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse293 4)) 4))))))) (.cse55 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse290 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse291 (select (select .cse290 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse290 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse291 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse290 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse291 4)) 4))))))) (.cse45 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse287 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse289 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse288 (+ .cse289 4))) (or (<= 0 (+ (select (select .cse287 v_arrayElimIndex_40) .cse288) 4)) (not (= (select (select (store .cse287 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse289 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse287 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse288) 4)) (= .cse288 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse51 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse284 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse286 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse285 (+ .cse286 4))) (or (<= 0 (+ (select (select .cse284 v_arrayElimIndex_40) .cse285) 4)) (not (= (select (select (store .cse284 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse286 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse284 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse285) 4)))))))) (.cse52 (forall ((v_arrayElimIndex_40 Int)) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse281 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse283 (select (select .cse281 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse282 (+ .cse283 4))) (or (<= 0 (+ (select (select .cse281 v_arrayElimIndex_40) .cse282) 4)) (not (= (select (select (store .cse281 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse283 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse281 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse282) 4)) (= .cse282 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (.cse36 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse278 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse279 (select (select .cse278 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse280 (+ .cse279 4))) (or (not (= (select (select (store .cse278 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse279 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse278 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse280) 4)) (= .cse280 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse44 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse275 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse277 (select (select .cse275 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse276 (+ .cse277 4))) (or (<= 0 (+ (select (select .cse275 v_arrayElimIndex_40) .cse276) 4)) (not (= (select (select (store .cse275 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse277 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse275 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse276) 4)) (= .cse276 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse53 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse273 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse274 (select (select .cse273 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse273 v_arrayElimIndex_40 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse274 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse273 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse274 4)) 4))))))) (.cse47 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse270 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse272 (select (select .cse270 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse271 (+ .cse272 4))) (or (<= 0 (+ (select (select .cse270 v_arrayElimIndex_40) .cse271) 4)) (not (= (select (select (store .cse270 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse272 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse270 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse271) 4)) (= .cse271 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse217 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (.cse23 (or .cse269 .cse3)) (.cse33 (or .cse2 .cse95)) (.cse46 (or .cse268 .cse3)) (.cse48 (or (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse265 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse266 (select (select .cse265 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse267 (+ .cse266 4))) (or (not (= (select (select (store .cse265 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse266 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse265 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse267) 4)) (= .cse267 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3)) (.cse56 (or .cse24 (and .cse94 .cse95))) (.cse59 (not .cse60)) (.cse152 (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (and (or (and (or .cse1 .cse2) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (+ .cse6 4))) (or (<= 0 (+ (select (select .cse4 v_arrayElimIndex_40) .cse5) 4)) (not (= (select (select (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5) 4)))))))) (or .cse2 .cse8) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse11 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ .cse11 4))) (or (<= 0 (+ (select (select .cse9 v_arrayElimIndex_40) .cse10) 4)) (not (= (select (select (store .cse9 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10) 4)) (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or .cse2 .cse12) (or (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse15 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (+ .cse15 4))) (or (<= 0 (+ (select (select .cse13 v_arrayElimIndex_40) .cse14) 4)) (not (= (select (select (store .cse13 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse14) 4)) (= .cse14 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse16) (or .cse3 (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse19 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (+ .cse19 4))) (or (<= 0 (+ (select (select .cse17 v_arrayElimIndex_40) .cse18) 4)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimIndex_40) (not (= (select (select (store .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse18) 4)) (= .cse18 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse22 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (+ .cse22 4))) (or (<= 0 (+ (select (select .cse20 v_arrayElimIndex_40) .cse21) 4)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse21) 4))))))) .cse3) .cse23 (or .cse24 (and .cse25 .cse26 .cse27 .cse28)) (or .cse29 .cse2) (or .cse3 (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse32 (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse31 (+ .cse32 4))) (or (<= 0 (+ (select (select .cse30 v_arrayElimIndex_40) .cse31) 4)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse32 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse31) 4)) (= .cse31 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse33 (or .cse2 .cse34) (or .cse24 (and .cse35 .cse36)) (or (forall ((v_ArrVal_1470 Int) (v_arrayElimIndex_40 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse39 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse38 (+ .cse39 4))) (or (<= 0 (+ (select (select .cse37 v_arrayElimIndex_40) .cse38) 4)) (not (= (select (select (store .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse38) 4)) (= .cse38 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse40) (or (forall ((v_arrayElimIndex_40 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse43 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (+ .cse43 4))) (or (<= 0 (+ (select (select .cse41 v_arrayElimIndex_40) .cse42) 4)) (not (= (select (select (store .cse41 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= v_arrayElimIndex_40 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse42) 4)) (= .cse42 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3) (or .cse2 .cse44) (or .cse2 .cse45) .cse46 (or .cse2 .cse47) .cse48 (or .cse24 (and .cse49 .cse50 .cse51 .cse52)) (or .cse2 .cse53) (or .cse2 .cse54) (or .cse2 .cse55) .cse56 (or .cse2 .cse57) (or .cse2 .cse58)) .cse59) (or .cse60 (and .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 (or .cse24 (and .cse61 .cse79 .cse62 .cse80 .cse81 .cse82 .cse64 .cse65 .cse83 .cse66 .cse67 .cse84 .cse69 .cse71 .cse72 .cse33 .cse85 .cse73 .cse74 .cse75 .cse86 .cse76 .cse77 .cse87 .cse88 .cse89 .cse48 .cse90 .cse91 .cse92 .cse93)) .cse87 .cse89 .cse48 .cse90 .cse92 .cse93)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 8) 0) (or .cse24 (and (or .cse60 (and .cse61 .cse79 .cse62 .cse80 .cse63 .cse81 .cse82 .cse64 .cse65 .cse83 .cse66 .cse67 .cse68 .cse84 .cse69 .cse70 .cse71 .cse72 .cse33 .cse85 .cse73 .cse74 .cse75 .cse86 .cse76 .cse77 .cse78 .cse87 .cse88 .cse89 .cse48 .cse90 .cse91 .cse92 .cse93)) (or (and .cse29 .cse49 .cse1 .cse25 .cse26 .cse50 .cse94 .cse58 .cse54 .cse12 .cse16 .cse8 .cse27 .cse28 .cse57 .cse34 .cse40 .cse35 .cse55 .cse45 .cse51 .cse52 .cse36 .cse95 .cse44 .cse53 .cse47) .cse59))) (= (select .cse7 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) .cse3 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (or .cse60 (let ((.cse99 (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse115 (not .cse99))) (let ((.cse100 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse214 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse216 (select (select .cse214 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse215 (+ .cse216 4))) (or (<= 0 (+ (select (select .cse214 v_arrayElimCell_1044) .cse215) 4)) (<= 0 (+ (select (select .cse214 0) .cse215) 4)) (not (= .cse216 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse215 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse214 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (.cse101 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse211 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse213 (select (select .cse211 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse212 (+ .cse213 4))) (or (<= 0 (+ (select (select .cse211 v_arrayElimCell_1044) .cse212) 4)) (<= 0 (+ (select (select .cse211 0) .cse212) 4)) (not (= (select (select (store .cse211 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse213 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse115)) (.cse102 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse209 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse210 (select (select .cse209 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse209 0) (+ .cse210 4)) 4)) (not (= (select (select (store .cse209 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse210 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (.cse103 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse207 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse208 (select (select .cse207 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse207 0) (+ .cse208 4)) 4)) (not (= (select (select (store .cse207 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse208 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115)) (.cse104 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse204 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse206 (select (select .cse204 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse205 (+ .cse206 4))) (or (<= 0 (+ (select (select .cse204 v_arrayElimCell_1044) .cse205) 4)) (<= 0 (+ (select (select .cse204 0) .cse205) 4)) (not (= (select (select (store .cse204 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse206 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse205 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse111 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse201 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse203 (select (select .cse201 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse202 (+ .cse203 4))) (or (<= 0 (+ (select (select .cse201 0) .cse202) 4)) (not (= (select (select (store .cse201 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse203 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse202 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse114 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse198 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse200 (select (select .cse198 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse199 (+ .cse200 4))) (or (<= 0 (+ (select (select .cse198 v_arrayElimCell_1044) .cse199) 4)) (<= 0 (+ (select (select .cse198 0) .cse199) 4)) (not (= (select (select (store .cse198 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse200 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse199 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse122 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse195 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse197 (select (select .cse195 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse196 (+ .cse197 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse195 0) .cse196) 4)) (not (= (select (select (store .cse195 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse197 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse196 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse123 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse192 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse194 (select (select .cse192 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse193 (+ .cse194 4))) (or (<= 0 (+ (select (select .cse192 v_arrayElimCell_1044) .cse193) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse192 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse192 0) .cse193) 4)) (not (= .cse194 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse193 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse127 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse189 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse191 (select (select .cse189 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse190 (+ .cse191 4))) (or (<= 0 (+ (select (select .cse189 0) .cse190) 4)) (not (= .cse191 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse190 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse189 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99)) (.cse128 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse187 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse188 (select (select .cse187 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse187 0) (+ .cse188 4)) 4)) (not (= .cse188 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse187 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse131 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse184 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse186 (select (select .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse185 (+ .cse186 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse184 v_arrayElimCell_1044) .cse185) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse184 0) .cse185) 4)) (not (= (select (select (store .cse184 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse186 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))) (.cse132 (or .cse115 (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse181 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse183 (select (select .cse181 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse182 (+ .cse183 4))) (or (not (= (select (select (store .cse181 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse181 0) .cse182) 4)) (not (= .cse183 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse182 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse136 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse178 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse180 (select (select .cse178 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse179 (+ .cse180 4))) (or (<= 0 (+ (select (select .cse178 v_arrayElimCell_1044) .cse179) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse178 0) .cse179) 4)) (not (= (select (select (store .cse178 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse180 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse115)) (.cse137 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse176 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse177 (select (select .cse176 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse176 0) (+ .cse177 4)) 4)) (not (= (select (select (store .cse176 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse177 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115)) (.cse138 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse173 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse175 (select (select .cse173 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse174 (+ .cse175 4))) (or (<= 0 (+ (select (select .cse173 v_arrayElimCell_1044) .cse174) 4)) (not (= (select (select (store .cse173 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse173 0) .cse174) 4)) (not (= .cse175 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse174 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse115)) (.cse145 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse170 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse172 (select (select .cse170 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse171 (+ .cse172 4))) (or (<= 0 (+ (select (select .cse170 0) .cse171) 4)) (not (= (select (select (store .cse170 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse172 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse171 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse146 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse167 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse169 (select (select .cse167 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse168 (+ .cse169 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse167 v_arrayElimCell_1044) .cse168) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select (store .cse167 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse167 0) .cse168) 4)) (not (= .cse169 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse168 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse147 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse164 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse166 (select (select .cse164 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse165 (+ .cse166 4))) (or (<= 0 (+ (select (select .cse164 v_arrayElimCell_1044) .cse165) 4)) (<= 0 (+ (select (select .cse164 0) .cse165) 4)) (not (= .cse166 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse164 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99)) (.cse151 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse162 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse163 (select (select .cse162 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= v_arrayElimCell_1044 0) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse162 0) (+ .cse163 4)) 4)) (not (= (select (select (store .cse162 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse163 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse115))) (and (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse96 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse98 (select (select .cse96 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse97 (+ .cse98 4))) (or (<= 0 (+ (select (select .cse96 v_arrayElimCell_1044) .cse97) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse96 0) .cse97) 4)) (not (= .cse98 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse96 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse100 .cse101 .cse102 .cse103 .cse104 (or (and .cse100 .cse101 .cse102 .cse103 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse105 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse107 (select (select .cse105 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse106 (+ .cse107 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse105 v_arrayElimCell_1044) .cse106) 4)) (<= 0 (+ (select (select .cse105 0) .cse106) 4)) (not (= (select (select (store .cse105 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse107 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse106 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse108 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse110 (select (select .cse108 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse109 (+ .cse110 4))) (or (not (= (select (select (store .cse108 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse108 0) .cse109) 4)) (not (= .cse110 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse109 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse104 .cse111 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse112 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse113 (select (select .cse112 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse112 0) (+ .cse113 4)) 4)) (not (= (select (select (store .cse112 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse113 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) .cse99) .cse114 (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse116 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse118 (select (select .cse116 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse117 (+ .cse118 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse116 v_arrayElimCell_1044) .cse117) 4)) (<= 0 (+ (select (select .cse116 0) .cse117) 4)) (not (= (select (select (store .cse116 v_arrayElimCell_1044 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse118 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or .cse115 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse119 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse121 (select (select .cse119 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse120 (+ .cse121 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse119 v_arrayElimCell_1044) .cse120) 4)) (not (= (select (select (store .cse119 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse119 0) .cse120) 4)) (not (= .cse121 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse120 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) .cse122 .cse123 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse124 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse126 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse125 (+ .cse126 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse124 v_arrayElimCell_1044) .cse125) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse124 0) .cse125) 4)) (not (= (select (select (store .cse124 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse126 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse125 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse99) .cse127 .cse128 (or .cse99 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse129 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse130 (select (select .cse129 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select (store .cse129 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse129 0) (+ .cse130 4)) 4)) (not (= .cse130 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse131 .cse132 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse133 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse135 (select (select .cse133 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse134 (+ .cse135 4))) (or (<= 0 (+ (select (select .cse133 v_arrayElimCell_1044) .cse134) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse133 0) .cse134) 4)) (not (= (select (select (store .cse133 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse135 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) .cse136 .cse137 .cse138 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse139 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse141 (select (select .cse139 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse140 (+ .cse141 4))) (or (<= 0 (+ (select (select .cse139 v_arrayElimCell_1044) .cse140) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse139 0) .cse140) 4)) (not (= (select (select (store .cse139 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse141 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse140 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse99) (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse142 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse144 (select (select .cse142 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse143 (+ .cse144 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse142 v_arrayElimCell_1044) .cse143) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse142 0) .cse143) 4)) (not (= (select (select (store .cse142 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse144 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse99) .cse145 .cse146 .cse147 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse148 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse150 (select (select .cse148 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse149 (+ .cse150 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse148 v_arrayElimCell_1044) .cse149) 4)) (<= 0 (+ (select (select .cse148 0) .cse149) 4)) (not (= (select (select (store .cse148 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse150 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) .cse151) .cse152) .cse111 .cse114 .cse122 .cse123 .cse127 .cse128 .cse131 .cse132 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse153 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse155 (select (select .cse153 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse154 (+ .cse155 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse153 v_arrayElimCell_1044) .cse154) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse153 0) .cse154) 4)) (not (= .cse155 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= (select (select (store .cse153 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse136 .cse137 .cse138 (or .cse99 (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse156 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse158 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse157 (+ .cse158 4))) (or (<= 0 (+ (select (select .cse156 v_arrayElimCell_1044) .cse157) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse156 0) .cse157) 4)) (not (= .cse158 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse157 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse156 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) .cse145 (or (forall ((v_arrayElimCell_1044 Int) (v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse159 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse161 (select (select .cse159 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse160 (+ .cse161 4))) (or (= v_arrayElimCell_1044 0) (<= 0 (+ (select (select .cse159 v_arrayElimCell_1044) .cse160) 4)) (= v_arrayElimCell_1044 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= 0 (+ (select (select .cse159 0) .cse160) 4)) (not (= .cse161 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse160 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse159 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) .cse99) .cse146 .cse147 .cse151)))) (not .cse217)) (or (let ((.cse222 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse263 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse262 (select (select .cse263 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse264 (+ .cse262 4))) (or (not (= .cse262 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse263 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse264) 4)) (= .cse264 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse263 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse221 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse261 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse260 (select (select .cse261 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse260 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse261 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ .cse260 4)) 4)) (not (= (select (select (store .cse261 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (let ((.cse241 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse257 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse259 (select (select .cse257 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse258 (+ .cse259 4))) (or (not (= (select (select (store .cse257 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse257 0) .cse258) 4)) (not (= .cse259 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse257 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse258) 4)) (= .cse258 |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (.cse219 (or .cse221 .cse2)) (.cse223 (or .cse2 .cse222)) (.cse236 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse254 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse256 (select (select .cse254 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse255 (+ .cse256 4))) (or (<= 0 (+ (select (select .cse254 0) .cse255) 4)) (not (= .cse256 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse254 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse255) 4)) (not (= (select (select (store .cse254 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (.cse237 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse251 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse253 (select (select .cse251 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse252 (+ .cse253 4))) (or (<= 0 (+ (select (select .cse251 0) .cse252) 4)) (not (= .cse253 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse251 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse252) 4)) (= .cse252 |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select (store .cse251 0 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (let ((.cse220 (or .cse3 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse248 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse250 (select (select .cse248 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse249 (+ .cse250 4))) (or (<= 0 (+ (select (select .cse248 0) .cse249) 4)) (not (= (select (select (store .cse248 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse250 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse248 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse249) 4)) (= .cse249 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (.cse224 (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse245 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse247 (select (select .cse245 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse246 (+ .cse247 4))) (or (<= 0 (+ (select (select .cse245 0) .cse246) 4)) (not (= (select (select (store .cse245 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse247 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse245 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse246) 4))))))) .cse3)) (.cse225 (or .cse2 .cse237)) (.cse227 (or .cse2 .cse236)) (.cse218 (and .cse23 .cse219 .cse33 .cse223 .cse46 .cse48 .cse56)) (.cse228 (or .cse217 (and .cse241 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1042 Int)) (let ((.cse242 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse244 (select (select .cse242 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse243 (+ .cse244 4))) (or (not (= (select (select (store .cse242 v_arrayElimCell_1042 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse242 0) .cse243) 4)) (not (= .cse244 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse242 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse243) 4)))))))))) (.cse226 (or .cse2 .cse241)) (.cse235 (or (forall ((v_ArrVal_1470 Int) (v_arrayElimCell_1043 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int))) (let ((.cse238 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse240 (select (select .cse238 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse239 (+ .cse240 4))) (or (not (= (select (select (store .cse238 v_arrayElimCell_1043 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (<= 0 (+ (select (select .cse238 0) .cse239) 4)) (not (= .cse240 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse238 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse239) 4)) (= .cse239 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) .cse3))) (and (or .cse217 .cse218) .cse23 .cse219 .cse220 .cse33 (or .cse24 (and .cse221 .cse222)) .cse223 .cse224 .cse225 (or .cse217 (and .cse220 .cse226)) .cse227 (or (and (or .cse24 (and .cse228 (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse229 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse231 (select (select .cse229 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse230 (+ .cse231 4))) (or (<= 0 (+ (select (select .cse229 0) .cse230) 4)) (not (= (select (select (store .cse229 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse231 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse229 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse230) 4)) (= .cse230 |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_1470 Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_arrayElimCell_1040 Int)) (let ((.cse232 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 .cse0 v_ArrVal_1470)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1474))) (let ((.cse234 (select (select .cse232 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse233 (+ .cse234 4))) (or (<= 0 (+ (select (select .cse232 0) .cse233) 4)) (not (= (select (select (store .cse232 v_arrayElimCell_1040 v_ArrVal_1476) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= .cse234 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (<= 0 (+ (select (select .cse232 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse233) 4))))))))) .cse220 .cse224 .cse225 .cse227 .cse226 (or (and .cse224 .cse225 .cse227 .cse235) .cse217) .cse235) .cse152) (or .cse218 .cse152) (or .cse24 (and .cse228 .cse236 .cse237)) .cse226 .cse46 (or .cse217 (and .cse226 .cse235)) .cse48 .cse235)))) .cse59) (not .cse152) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from true [2022-11-25 22:45:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:51,579 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-11-25 22:45:51,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 22:45:51,580 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 52 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) Word has length 30 [2022-11-25 22:45:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:51,581 INFO L225 Difference]: With dead ends: 105 [2022-11-25 22:45:51,581 INFO L226 Difference]: Without dead ends: 105 [2022-11-25 22:45:51,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2439 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=838, Invalid=6986, Unknown=24, NotChecked=708, Total=8556 [2022-11-25 22:45:51,584 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 380 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:51,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 385 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 813 Invalid, 0 Unknown, 120 Unchecked, 2.4s Time] [2022-11-25 22:45:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-25 22:45:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 57. [2022-11-25 22:45:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 56 states have internal predecessors, (62), 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) [2022-11-25 22:45:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-25 22:45:51,587 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 30 [2022-11-25 22:45:51,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:51,587 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-25 22:45:51,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 52 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) [2022-11-25 22:45:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-25 22:45:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 22:45:51,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:51,589 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:45:51,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:51,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 22:45:51,795 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:45:51,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:51,795 INFO L85 PathProgramCache]: Analyzing trace with hash -439721473, now seen corresponding path program 1 times [2022-11-25 22:45:51,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:45:51,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812887994] [2022-11-25 22:45:51,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:45:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 22:45:51,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:45:51,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812887994] [2022-11-25 22:45:51,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812887994] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:45:51,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095358568] [2022-11-25 22:45:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:51,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:45:51,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:45:51,935 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:45:51,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 22:45:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:52,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:45:52,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 22:45:52,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 22:45:52,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095358568] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:45:52,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [516246618] [2022-11-25 22:45:52,515 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-25 22:45:52,515 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:45:52,516 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:45:52,516 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:45:52,516 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:45:52,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 22:45:52,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-25 22:45:52,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:52,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:52,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:45:52,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:52,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:45:52,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:52,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:45:52,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:45:52,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-25 22:45:52,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-25 22:45:52,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:45:52,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:52,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-25 22:45:53,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:45:53,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:45:53,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 22:45:53,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:53,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-25 22:45:53,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:53,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-25 22:45:53,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:53,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-25 22:45:53,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:53,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:53,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-25 22:45:53,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-25 22:45:53,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:45:53,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:45:53,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-25 22:45:53,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:53,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:45:53,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-25 22:45:53,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:45:53,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-25 22:45:53,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:54,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:54,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:45:54,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:54,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-25 22:45:54,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:54,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:54,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:54,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:54,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:54,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-25 22:45:54,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:54,576 INFO L321 Elim1Store]: treesize reduction 46, result has 49.5 percent of original size [2022-11-25 22:45:54,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 92 [2022-11-25 22:45:54,720 INFO L321 Elim1Store]: treesize reduction 58, result has 30.1 percent of original size [2022-11-25 22:45:54,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 76 [2022-11-25 22:45:54,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:45:55,184 INFO L321 Elim1Store]: treesize reduction 14, result has 65.0 percent of original size [2022-11-25 22:45:55,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2022-11-25 22:45:55,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 22:45:55,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-25 22:45:55,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:56,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:56,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:56,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:45:56,569 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-25 22:45:56,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 77 [2022-11-25 22:45:56,733 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-25 22:45:56,734 INFO L350 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 2 case distinctions, treesize of input 50 treesize of output 61 [2022-11-25 22:45:56,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:56,864 INFO L321 Elim1Store]: treesize reduction 35, result has 35.2 percent of original size [2022-11-25 22:45:56,865 INFO L350 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 2 case distinctions, treesize of input 28 treesize of output 33 [2022-11-25 22:45:57,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:57,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:45:57,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:57,418 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-25 22:45:57,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 77 [2022-11-25 22:45:57,588 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-25 22:45:57,588 INFO L350 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 2 case distinctions, treesize of input 50 treesize of output 61 [2022-11-25 22:45:57,705 INFO L321 Elim1Store]: treesize reduction 35, result has 35.2 percent of original size [2022-11-25 22:45:57,705 INFO L350 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 2 case distinctions, treesize of input 28 treesize of output 33 [2022-11-25 22:45:57,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:58,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 22:45:58,432 INFO L350 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 6 treesize of output 5 [2022-11-25 22:45:58,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:45:58,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:58,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 22:45:58,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:58,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:45:58,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:58,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:58,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:58,591 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:45:58,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:45:58,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:45:58,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:45:58,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:58,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:58,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:58,717 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:45:58,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-25 22:45:58,785 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:46:06,894 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5083#(and (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))) (< |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_dll_create_~data#1| 1) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))' at error location [2022-11-25 22:46:06,894 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 22:46:06,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:46:06,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-25 22:46:06,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435488831] [2022-11-25 22:46:06,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:46:06,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:46:06,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:46:06,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:46:06,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-11-25 22:46:06,896 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:46:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:46:06,991 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-11-25 22:46:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:46:06,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-25 22:46:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:46:06,992 INFO L225 Difference]: With dead ends: 57 [2022-11-25 22:46:06,992 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 22:46:06,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-11-25 22:46:06,993 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:46:06,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 72 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:46:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 22:46:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-25 22:46:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 56 states have internal predecessors, (61), 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) [2022-11-25 22:46:06,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-11-25 22:46:06,996 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 31 [2022-11-25 22:46:06,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:46:06,997 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-11-25 22:46:06,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:46:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-11-25 22:46:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 22:46:06,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:46:06,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:46:07,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 22:46:07,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-25 22:46:07,206 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-25 22:46:07,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:46:07,206 INFO L85 PathProgramCache]: Analyzing trace with hash -801981762, now seen corresponding path program 1 times [2022-11-25 22:46:07,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:46:07,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077503553] [2022-11-25 22:46:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:46:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:46:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:46:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:46:13,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:46:13,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077503553] [2022-11-25 22:46:13,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077503553] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:46:13,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681866688] [2022-11-25 22:46:13,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:46:13,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:46:13,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:46:13,202 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:46:13,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4cd27b2-dfae-465c-9ce0-87f65d3b6fe9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 22:46:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:46:13,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-25 22:46:13,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:46:13,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:46:13,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:46:13,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:46:13,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:46:13,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:46:13,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:46:14,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:46:14,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:46:14,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:46:14,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:46:14,725 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:46:14,726 INFO L350 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 18 [2022-11-25 22:46:14,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:46:14,820 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 22:46:14,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-11-25 22:46:15,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:46:15,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:46:15,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:46:15,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:46:15,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:46:15,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-25 22:46:15,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:46:15,860 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:46:15,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 67 [2022-11-25 22:46:15,905 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 22:46:15,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2022-11-25 22:46:17,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:46:18,213 INFO L321 Elim1Store]: treesize reduction 208, result has 31.6 percent of original size [2022-11-25 22:46:18,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 155 treesize of output 172 [2022-11-25 22:46:18,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:46:18,532 INFO L321 Elim1Store]: treesize reduction 72, result has 51.7 percent of original size [2022-11-25 22:46:18,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 136 [2022-11-25 22:46:19,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:46:19,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-11-25 22:46:23,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:46:23,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:46:23,922 INFO L321 Elim1Store]: treesize reduction 167, result has 16.9 percent of original size [2022-11-25 22:46:23,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 29 case distinctions, treesize of input 206 treesize of output 196 [2022-11-25 22:46:24,089 INFO L321 Elim1Store]: treesize reduction 218, result has 7.2 percent of original size [2022-11-25 22:46:24,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 187 treesize of output 189 [2022-11-25 22:46:26,546 INFO L321 Elim1Store]: treesize reduction 153, result has 40.5 percent of original size [2022-11-25 22:46:26,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 216 treesize of output 259 [2022-11-25 22:46:27,066 INFO L321 Elim1Store]: treesize reduction 141, result has 41.5 percent of original size [2022-11-25 22:46:27,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 210 treesize of output 223 [2022-11-25 22:46:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:46:27,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:46:48,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:46:48,705 INFO L350 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 2116 treesize of output 1672 [2022-11-25 22:46:48,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:46:48,762 INFO L350 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 1700 treesize of output 1136 [2022-11-25 22:46:48,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:46:48,943 INFO L350 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 2116 treesize of output 1572 [2022-11-25 22:46:48,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:46:48,984 INFO L350 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 1600 treesize of output 1136 [2022-11-25 22:46:50,146 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse11 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1749 Int) (v_ArrVal_1754 Int) (v_ArrVal_1753 Int) (v_arrayElimArr_216 (Array Int Int)) (v_arrayElimArr_215 (Array Int Int))) (let ((.cse0 (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_215))) (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 v_ArrVal_1749)))) (.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_216))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse8 (select (select .cse0 .cse3) .cse9))) (let ((.cse2 (+ 8 .cse8)) (.cse5 (+ .cse8 4)) (.cse1 (select (select .cse7 .cse3) .cse9))) (or (not (= (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1753)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (not (= (select v_arrayElimArr_216 .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (<= 0 .cse5)) (= (select (select (let ((.cse6 (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_1754)))) (store .cse6 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| .cse1))) .cse1) .cse5) 0) (not (<= (+ .cse8 12) (select |c_#length| .cse1))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_215 .cse4))))))))) (forall ((v_ArrVal_1749 Int) (v_arrayElimArr_218 (Array Int Int)) (v_ArrVal_1753 Int) (v_arrayElimArr_217 (Array Int Int))) (let ((.cse19 (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_217))) (store .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 v_ArrVal_1749)))) (.cse21 (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_218))) (store .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse13 (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (+ 4 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse17 (select (select .cse21 .cse13) .cse20)) (.cse16 (select (select .cse19 .cse13) .cse20))) (let ((.cse14 (store .cse19 .cse17 (store (select .cse19 .cse17) (+ .cse16 8) v_ArrVal_1753)))) (let ((.cse18 (+ .cse16 4)) (.cse15 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (not (= .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_217 .cse4))) (= (select (select (store .cse14 |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset| .cse16)) .cse17) .cse18) 0) (not (<= 0 .cse18)) (not (<= (+ .cse16 12) (select |c_#length| .cse17))) (not (= (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= (select v_arrayElimArr_218 .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))))) is different from false [2022-11-25 22:47:02,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:47:02,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2629 treesize of output 1959 [2022-11-25 22:47:02,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:47:02,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1993 treesize of output 1143 [2022-11-25 22:47:02,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:47:25,216 WARN L233 SmtUtils]: Spent 22.74s on a formula simplification. DAG size of input: 95 DAG size of output: 75 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-25 22:47:25,217 INFO L321 Elim1Store]: treesize reduction 231, result has 60.6 percent of original size [2022-11-25 22:47:25,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 103654 treesize of output 93463