./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/wc-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/wc-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f341eaff5b8d59d4b432d28ef9496964fb23f130f25d76d129a608308250bd30 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:36:15,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:36:15,545 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2023-12-02 15:36:15,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:36:15,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:36:15,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:36:15,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:36:15,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:36:15,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:36:15,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:36:15,576 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:36:15,576 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:36:15,577 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:36:15,577 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:36:15,578 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:36:15,578 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:36:15,579 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:36:15,579 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:36:15,579 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:36:15,580 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:36:15,580 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:36:15,581 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:36:15,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:36:15,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:36:15,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:36:15,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:36:15,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:36:15,583 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:36:15,584 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:36:15,584 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:36:15,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:36:15,585 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:36:15,585 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:36:15,585 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:36:15,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:36:15,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:36:15,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:36:15,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:36:15,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:36:15,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:36:15,587 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:36:15,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:36:15,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:36:15,587 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:36:15,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:36:15,588 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/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_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f341eaff5b8d59d4b432d28ef9496964fb23f130f25d76d129a608308250bd30 [2023-12-02 15:36:15,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:36:15,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:36:15,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:36:15,837 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:36:15,838 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:36:15,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/busybox-1.22.0/wc-2.i [2023-12-02 15:36:18,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:36:18,989 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:36:18,989 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/sv-benchmarks/c/busybox-1.22.0/wc-2.i [2023-12-02 15:36:19,017 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/data/8384d4ab7/f4ea4be36b4f4e4ab0ac8aec1e14e789/FLAGf3d455fac [2023-12-02 15:36:19,031 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/data/8384d4ab7/f4ea4be36b4f4e4ab0ac8aec1e14e789 [2023-12-02 15:36:19,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:36:19,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:36:19,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:36:19,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:36:19,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:36:19,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:36:19" (1/1) ... [2023-12-02 15:36:19,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e74dd9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:19, skipping insertion in model container [2023-12-02 15:36:19,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:36:19" (1/1) ... [2023-12-02 15:36:19,151 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:36:20,257 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:36:20,284 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-12-02 15:36:20,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4852b3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:20, skipping insertion in model container [2023-12-02 15:36:20,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:36:20,285 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 15:36:20,287 INFO L158 Benchmark]: Toolchain (without parser) took 1250.47ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 96.7MB in the end (delta: 39.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-12-02 15:36:20,288 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:36:20,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1248.10ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 96.7MB in the end (delta: 39.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-12-02 15:36:20,290 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1248.10ms. Allocated memory is still 178.3MB. Free memory was 136.0MB in the beginning and 96.7MB in the end (delta: 39.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2218]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/wc-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f341eaff5b8d59d4b432d28ef9496964fb23f130f25d76d129a608308250bd30 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:36:22,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:36:22,085 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Bitvector.epf [2023-12-02 15:36:22,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:36:22,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:36:22,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:36:22,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:36:22,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:36:22,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:36:22,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:36:22,122 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:36:22,122 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:36:22,123 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:36:22,123 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:36:22,124 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:36:22,124 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:36:22,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:36:22,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:36:22,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:36:22,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:36:22,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:36:22,128 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:36:22,128 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:36:22,128 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:36:22,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:36:22,129 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:36:22,130 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 15:36:22,130 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 15:36:22,131 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:36:22,131 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:36:22,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:36:22,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 15:36:22,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:36:22,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:36:22,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:36:22,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:36:22,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:36:22,133 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 15:36:22,134 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 15:36:22,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:36:22,134 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:36:22,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:36:22,134 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/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_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f341eaff5b8d59d4b432d28ef9496964fb23f130f25d76d129a608308250bd30 [2023-12-02 15:36:22,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:36:22,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:36:22,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:36:22,486 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:36:22,486 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:36:22,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/busybox-1.22.0/wc-2.i [2023-12-02 15:36:25,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:36:25,652 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:36:25,653 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/sv-benchmarks/c/busybox-1.22.0/wc-2.i [2023-12-02 15:36:25,679 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/data/0e379d33c/796da78bbbf34e8c98175e5ee103594e/FLAG703a7d2f0 [2023-12-02 15:36:25,693 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/data/0e379d33c/796da78bbbf34e8c98175e5ee103594e [2023-12-02 15:36:25,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:36:25,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:36:25,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:36:25,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:36:25,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:36:25,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:36:25" (1/1) ... [2023-12-02 15:36:25,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d1182c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:25, skipping insertion in model container [2023-12-02 15:36:25,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:36:25" (1/1) ... [2023-12-02 15:36:25,772 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:36:26,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:36:26,849 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 15:36:26,895 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:36:27,020 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:36:27,031 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:36:27,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:36:27,377 WARN L675 CHandler]: The function fflush is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:36:27,377 WARN L675 CHandler]: The function strerror is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:36:27,377 WARN L675 CHandler]: The function fopen is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:36:27,377 WARN L675 CHandler]: The function ferror is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:36:27,377 WARN L675 CHandler]: The function strstr is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:36:27,377 WARN L675 CHandler]: The function fclose is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:36:27,378 WARN L675 CHandler]: The function strtoul is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:36:27,378 WARN L675 CHandler]: The function fgetc is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:36:27,384 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:36:27,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27 WrapperNode [2023-12-02 15:36:27,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:36:27,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:36:27,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:36:27,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:36:27,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (1/1) ... [2023-12-02 15:36:27,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (1/1) ... [2023-12-02 15:36:27,533 INFO L138 Inliner]: procedures = 591, calls = 489, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1681 [2023-12-02 15:36:27,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:36:27,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:36:27,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:36:27,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:36:27,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (1/1) ... [2023-12-02 15:36:27,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (1/1) ... [2023-12-02 15:36:27,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (1/1) ... [2023-12-02 15:36:27,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (1/1) ... [2023-12-02 15:36:27,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (1/1) ... [2023-12-02 15:36:27,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (1/1) ... [2023-12-02 15:36:27,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (1/1) ... [2023-12-02 15:36:27,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (1/1) ... [2023-12-02 15:36:27,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:36:27,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:36:27,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:36:27,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:36:27,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (1/1) ... [2023-12-02 15:36:27,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:36:27,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:36:27,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:36:27,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:36:27,752 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2023-12-02 15:36:27,752 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2023-12-02 15:36:27,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:36:27,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 15:36:27,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-12-02 15:36:27,753 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2023-12-02 15:36:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2023-12-02 15:36:27,753 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2023-12-02 15:36:27,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:36:27,753 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-12-02 15:36:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:36:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:36:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2023-12-02 15:36:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2023-12-02 15:36:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2023-12-02 15:36:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2023-12-02 15:36:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:36:27,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:36:27,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 15:36:27,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2023-12-02 15:36:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2023-12-02 15:36:27,755 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2023-12-02 15:36:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2023-12-02 15:36:27,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 15:36:27,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-12-02 15:36:27,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-12-02 15:36:27,755 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2023-12-02 15:36:27,756 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2023-12-02 15:36:27,756 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2023-12-02 15:36:27,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 15:36:27,756 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 15:36:27,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 15:36:27,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 15:36:27,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:36:27,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:36:27,756 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2023-12-02 15:36:27,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2023-12-02 15:36:27,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-12-02 15:36:27,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 15:36:27,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 15:36:27,757 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2023-12-02 15:36:27,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2023-12-02 15:36:27,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2023-12-02 15:36:27,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-12-02 15:36:27,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2023-12-02 15:36:27,757 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-12-02 15:36:27,757 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2023-12-02 15:36:27,758 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2023-12-02 15:36:28,195 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:36:28,196 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:36:28,349 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 15:36:37,224 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:36:37,389 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:36:37,389 INFO L309 CfgBuilder]: Removed 29 assume(true) statements. [2023-12-02 15:36:37,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:36:37 BoogieIcfgContainer [2023-12-02 15:36:37,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:36:37,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:36:37,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:36:37,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:36:37,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:36:25" (1/3) ... [2023-12-02 15:36:37,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c5bd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:36:37, skipping insertion in model container [2023-12-02 15:36:37,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:36:27" (2/3) ... [2023-12-02 15:36:37,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c5bd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:36:37, skipping insertion in model container [2023-12-02 15:36:37,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:36:37" (3/3) ... [2023-12-02 15:36:37,399 INFO L112 eAbstractionObserver]: Analyzing ICFG wc-2.i [2023-12-02 15:36:37,417 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:36:37,417 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 488 error locations. [2023-12-02 15:36:37,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:36:37,488 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;@a292282, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:36:37,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 488 error locations. [2023-12-02 15:36:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 1066 states, 551 states have (on average 2.246823956442831) internal successors, (1238), 1035 states have internal predecessors, (1238), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-02 15:36:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:36:37,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:36:37,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:36:37,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:36:37,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:36:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash 72571, now seen corresponding path program 1 times [2023-12-02 15:36:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:36:37,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216338248] [2023-12-02 15:36:37,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:36:37,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:36:37,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:36:37,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:36:37,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 15:36:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:36:37,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:36:37,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:36:38,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 15:36:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:38,018 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:36:38,019 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:36:38,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216338248] [2023-12-02 15:36:38,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216338248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:36:38,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:36:38,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:36:38,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011313980] [2023-12-02 15:36:38,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:36:38,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:36:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:36:38,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:36:38,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:36:38,053 INFO L87 Difference]: Start difference. First operand has 1066 states, 551 states have (on average 2.246823956442831) internal successors, (1238), 1035 states have internal predecessors, (1238), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:36:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:36:41,365 INFO L93 Difference]: Finished difference Result 1210 states and 1417 transitions. [2023-12-02 15:36:41,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:36:41,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-12-02 15:36:41,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:36:41,384 INFO L225 Difference]: With dead ends: 1210 [2023-12-02 15:36:41,384 INFO L226 Difference]: Without dead ends: 1209 [2023-12-02 15:36:41,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:36:41,387 INFO L413 NwaCegarLoop]: 972 mSDtfsCounter, 397 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:36:41,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1547 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-02 15:36:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2023-12-02 15:36:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1054. [2023-12-02 15:36:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 546 states have (on average 2.172161172161172) internal successors, (1186), 1027 states have internal predecessors, (1186), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 15:36:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1230 transitions. [2023-12-02 15:36:41,466 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1230 transitions. Word has length 2 [2023-12-02 15:36:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:36:41,466 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 1230 transitions. [2023-12-02 15:36:41,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:36:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1230 transitions. [2023-12-02 15:36:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 15:36:41,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:36:41,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 15:36:41,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:36:41,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:36:41,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:36:41,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:36:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash 72572, now seen corresponding path program 1 times [2023-12-02 15:36:41,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:36:41,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674992524] [2023-12-02 15:36:41,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:36:41,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:36:41,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:36:41,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:36:41,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 15:36:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:36:41,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:36:41,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:36:41,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:36:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:42,017 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:36:42,017 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:36:42,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674992524] [2023-12-02 15:36:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674992524] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:36:42,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:36:42,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:36:42,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644107154] [2023-12-02 15:36:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:36:42,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:36:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:36:42,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:36:42,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:36:42,021 INFO L87 Difference]: Start difference. First operand 1054 states and 1230 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:36:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:36:47,114 INFO L93 Difference]: Finished difference Result 1053 states and 1229 transitions. [2023-12-02 15:36:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:36:47,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-12-02 15:36:47,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:36:47,120 INFO L225 Difference]: With dead ends: 1053 [2023-12-02 15:36:47,120 INFO L226 Difference]: Without dead ends: 1053 [2023-12-02 15:36:47,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:36:47,122 INFO L413 NwaCegarLoop]: 1112 mSDtfsCounter, 9 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:36:47,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1824 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-12-02 15:36:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2023-12-02 15:36:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1053. [2023-12-02 15:36:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 546 states have (on average 2.17032967032967) internal successors, (1185), 1026 states have internal predecessors, (1185), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 15:36:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1229 transitions. [2023-12-02 15:36:47,153 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1229 transitions. Word has length 2 [2023-12-02 15:36:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:36:47,154 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 1229 transitions. [2023-12-02 15:36:47,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:36:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1229 transitions. [2023-12-02 15:36:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 15:36:47,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:36:47,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 15:36:47,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 15:36:47,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:36:47,355 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:36:47,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:36:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash 71599101, now seen corresponding path program 1 times [2023-12-02 15:36:47,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:36:47,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834345300] [2023-12-02 15:36:47,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:36:47,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:36:47,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:36:47,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:36:47,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 15:36:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:36:47,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:36:47,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:36:47,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:36:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:47,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:36:47,743 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:36:47,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834345300] [2023-12-02 15:36:47,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834345300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:36:47,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:36:47,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:36:47,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081009651] [2023-12-02 15:36:47,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:36:47,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:36:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:36:47,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:36:47,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:36:47,745 INFO L87 Difference]: Start difference. First operand 1053 states and 1229 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:36:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:36:54,402 INFO L93 Difference]: Finished difference Result 1055 states and 1231 transitions. [2023-12-02 15:36:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:36:54,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 15:36:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:36:54,409 INFO L225 Difference]: With dead ends: 1055 [2023-12-02 15:36:54,409 INFO L226 Difference]: Without dead ends: 1055 [2023-12-02 15:36:54,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:36:54,411 INFO L413 NwaCegarLoop]: 1111 mSDtfsCounter, 9 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:36:54,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2536 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-02 15:36:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2023-12-02 15:36:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2023-12-02 15:36:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 548 states have (on average 2.1660583941605838) internal successors, (1187), 1028 states have internal predecessors, (1187), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 15:36:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1231 transitions. [2023-12-02 15:36:54,440 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1231 transitions. Word has length 4 [2023-12-02 15:36:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:36:54,440 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1231 transitions. [2023-12-02 15:36:54,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:36:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1231 transitions. [2023-12-02 15:36:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:36:54,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:36:54,441 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-12-02 15:36:54,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 15:36:54,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:36:54,642 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:36:54,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:36:54,643 INFO L85 PathProgramCache]: Analyzing trace with hash 89107124, now seen corresponding path program 1 times [2023-12-02 15:36:54,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:36:54,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139317696] [2023-12-02 15:36:54,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:36:54,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:36:54,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:36:54,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:36:54,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 15:36:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:36:54,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:36:54,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:36:54,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:36:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:55,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:36:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:55,603 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:36:55,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139317696] [2023-12-02 15:36:55,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139317696] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:36:55,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [120088831] [2023-12-02 15:36:55,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:36:55,603 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:36:55,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:36:55,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:36:55,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-02 15:36:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:36:56,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:36:56,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:36:56,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:36:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:56,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:36:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:56,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [120088831] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:36:56,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765769988] [2023-12-02 15:36:56,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:36:56,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:36:56,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:36:56,569 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:36:56,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 15:36:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:36:56,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:36:56,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:36:56,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:36:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:56,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:36:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765769988] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:36:57,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:36:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 3] total 6 [2023-12-02 15:36:57,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642434214] [2023-12-02 15:36:57,233 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:36:57,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:36:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:36:57,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:36:57,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:36:57,234 INFO L87 Difference]: Start difference. First operand 1055 states and 1231 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:37:21,693 INFO L93 Difference]: Finished difference Result 1057 states and 1233 transitions. [2023-12-02 15:37:21,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:37:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-02 15:37:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:37:21,701 INFO L225 Difference]: With dead ends: 1057 [2023-12-02 15:37:21,701 INFO L226 Difference]: Without dead ends: 1057 [2023-12-02 15:37:21,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:37:21,702 INFO L413 NwaCegarLoop]: 1110 mSDtfsCounter, 19 mSDsluCounter, 2852 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3962 SdHoareTripleChecker+Invalid, 2179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:37:21,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3962 Invalid, 2179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 24.3s Time] [2023-12-02 15:37:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2023-12-02 15:37:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1057. [2023-12-02 15:37:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 551 states have (on average 2.1578947368421053) internal successors, (1189), 1030 states have internal predecessors, (1189), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 15:37:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1233 transitions. [2023-12-02 15:37:21,728 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1233 transitions. Word has length 6 [2023-12-02 15:37:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:37:21,729 INFO L495 AbstractCegarLoop]: Abstraction has 1057 states and 1233 transitions. [2023-12-02 15:37:21,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1233 transitions. [2023-12-02 15:37:21,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:37:21,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:37:21,731 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2023-12-02 15:37:21,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-02 15:37:21,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 15:37:22,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 15:37:22,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:37:22,338 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:37:22,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:37:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash 328688765, now seen corresponding path program 1 times [2023-12-02 15:37:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:37:22,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309199410] [2023-12-02 15:37:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:22,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:37:22,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:37:22,340 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:37:22,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 15:37:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:22,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:37:22,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:22,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:22,725 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:37:22,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309199410] [2023-12-02 15:37:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309199410] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:37:22,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [141598485] [2023-12-02 15:37:22,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:22,726 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:37:22,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:37:22,727 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:37:22,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-02 15:37:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:23,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:37:23,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:23,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:23,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [141598485] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:37:23,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004638014] [2023-12-02 15:37:23,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:23,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:37:23,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:37:23,382 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:37:23,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 15:37:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:23,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:37:23,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:23,741 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-02 15:37:23,741 INFO L378 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 21 treesize of output 20 [2023-12-02 15:37:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 15:37:23,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:37:23,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004638014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:37:23,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2023-12-02 15:37:23,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [6, 6, 6, 6] total 11 [2023-12-02 15:37:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906337330] [2023-12-02 15:37:23,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:37:23,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:37:23,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:37:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:37:23,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:37:23,843 INFO L87 Difference]: Start difference. First operand 1057 states and 1233 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:37:27,259 INFO L93 Difference]: Finished difference Result 1411 states and 1647 transitions. [2023-12-02 15:37:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:37:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 [2023-12-02 15:37:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:37:27,269 INFO L225 Difference]: With dead ends: 1411 [2023-12-02 15:37:27,269 INFO L226 Difference]: Without dead ends: 1411 [2023-12-02 15:37:27,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:37:27,271 INFO L413 NwaCegarLoop]: 949 mSDtfsCounter, 616 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:37:27,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1526 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-02 15:37:27,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2023-12-02 15:37:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1237. [2023-12-02 15:37:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 721 states have (on average 2.1692094313453536) internal successors, (1564), 1199 states have internal predecessors, (1564), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:37:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1623 transitions. [2023-12-02 15:37:27,308 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1623 transitions. Word has length 11 [2023-12-02 15:37:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:37:27,308 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1623 transitions. [2023-12-02 15:37:27,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1623 transitions. [2023-12-02 15:37:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 15:37:27,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:37:27,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2023-12-02 15:37:27,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 15:37:27,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 15:37:27,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-12-02 15:37:27,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:37:27,910 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:37:27,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:37:27,911 INFO L85 PathProgramCache]: Analyzing trace with hash 328688766, now seen corresponding path program 1 times [2023-12-02 15:37:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:37:27,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573721561] [2023-12-02 15:37:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:27,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:37:27,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:37:27,912 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:37:27,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-02 15:37:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:28,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:37:28,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:28,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:28,321 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:37:28,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573721561] [2023-12-02 15:37:28,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573721561] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:37:28,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [957729344] [2023-12-02 15:37:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:28,322 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:37:28,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:37:28,323 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:37:28,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-02 15:37:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:28,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:37:28,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:28,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:28,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [957729344] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:37:29,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575929437] [2023-12-02 15:37:29,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:29,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:37:29,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:37:29,001 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:37:29,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 15:37:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:29,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:37:29,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:29,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:29,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575929437] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:37:29,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:37:29,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 7] total 13 [2023-12-02 15:37:29,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242595241] [2023-12-02 15:37:29,468 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:37:29,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 15:37:29,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:37:29,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 15:37:29,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:37:29,469 INFO L87 Difference]: Start difference. First operand 1237 states and 1623 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:37:33,774 INFO L93 Difference]: Finished difference Result 1247 states and 1633 transitions. [2023-12-02 15:37:33,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 15:37:33,776 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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 11 [2023-12-02 15:37:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:37:33,782 INFO L225 Difference]: With dead ends: 1247 [2023-12-02 15:37:33,782 INFO L226 Difference]: Without dead ends: 1247 [2023-12-02 15:37:33,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2023-12-02 15:37:33,784 INFO L413 NwaCegarLoop]: 1113 mSDtfsCounter, 6 mSDsluCounter, 6666 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7779 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:37:33,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7779 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-02 15:37:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2023-12-02 15:37:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1247. [2023-12-02 15:37:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 731 states have (on average 2.153214774281806) internal successors, (1574), 1209 states have internal predecessors, (1574), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:37:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1633 transitions. [2023-12-02 15:37:33,817 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1633 transitions. Word has length 11 [2023-12-02 15:37:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:37:33,817 INFO L495 AbstractCegarLoop]: Abstraction has 1247 states and 1633 transitions. [2023-12-02 15:37:33,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1633 transitions. [2023-12-02 15:37:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 15:37:33,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:37:33,818 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-12-02 15:37:33,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 15:37:34,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-02 15:37:34,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2023-12-02 15:37:34,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:37:34,419 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:37:34,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:37:34,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1646381323, now seen corresponding path program 2 times [2023-12-02 15:37:34,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:37:34,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532776112] [2023-12-02 15:37:34,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:37:34,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:37:34,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:37:34,421 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:37:34,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-02 15:37:34,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 15:37:34,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:37:34,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 15:37:34,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:34,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:37:34,782 INFO L378 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 9 [2023-12-02 15:37:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-02 15:37:35,009 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:37:35,009 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:37:35,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532776112] [2023-12-02 15:37:35,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532776112] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:37:35,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:37:35,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:37:35,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668855724] [2023-12-02 15:37:35,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:37:35,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:37:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:37:35,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:37:35,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:37:35,010 INFO L87 Difference]: Start difference. First operand 1247 states and 1633 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:40,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:37:40,129 INFO L93 Difference]: Finished difference Result 1250 states and 1635 transitions. [2023-12-02 15:37:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:37:40,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 21 [2023-12-02 15:37:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:37:40,136 INFO L225 Difference]: With dead ends: 1250 [2023-12-02 15:37:40,136 INFO L226 Difference]: Without dead ends: 1250 [2023-12-02 15:37:40,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:37:40,137 INFO L413 NwaCegarLoop]: 1112 mSDtfsCounter, 6 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:37:40,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1830 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-12-02 15:37:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-12-02 15:37:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2023-12-02 15:37:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 734 states have (on average 2.147138964577657) internal successors, (1576), 1211 states have internal predecessors, (1576), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:37:40,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1635 transitions. [2023-12-02 15:37:40,178 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1635 transitions. Word has length 21 [2023-12-02 15:37:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:37:40,178 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1635 transitions. [2023-12-02 15:37:40,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1635 transitions. [2023-12-02 15:37:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 15:37:40,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:37:40,180 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:37:40,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-02 15:37:40,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:37:40,380 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:37:40,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:37:40,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2011652344, now seen corresponding path program 1 times [2023-12-02 15:37:40,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:37:40,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180884705] [2023-12-02 15:37:40,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:40,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:37:40,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:37:40,383 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:37:40,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-02 15:37:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:40,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:37:40,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:40,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:41,196 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:37:41,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180884705] [2023-12-02 15:37:41,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180884705] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:37:41,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1097896786] [2023-12-02 15:37:41,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:41,197 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:37:41,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:37:41,198 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:37:41,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-12-02 15:37:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:41,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:37:41,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:42,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:42,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1097896786] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:37:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604337617] [2023-12-02 15:37:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:42,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:37:42,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:37:42,085 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:37:42,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 15:37:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:42,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:37:42,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:42,490 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2023-12-02 15:37:42,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 15:37:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-02 15:37:42,534 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:37:42,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604337617] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:37:42,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2023-12-02 15:37:42,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [11, 11, 11, 11] total 21 [2023-12-02 15:37:42,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703498736] [2023-12-02 15:37:42,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:37:42,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:37:42,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:37:42,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:37:42,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-12-02 15:37:42,536 INFO L87 Difference]: Start difference. First operand 1250 states and 1635 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:37:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:37:45,694 INFO L93 Difference]: Finished difference Result 1323 states and 1636 transitions. [2023-12-02 15:37:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:37:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2023-12-02 15:37:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:37:45,701 INFO L225 Difference]: With dead ends: 1323 [2023-12-02 15:37:45,701 INFO L226 Difference]: Without dead ends: 1323 [2023-12-02 15:37:45,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-12-02 15:37:45,702 INFO L413 NwaCegarLoop]: 968 mSDtfsCounter, 382 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:37:45,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1548 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-02 15:37:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2023-12-02 15:37:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1245. [2023-12-02 15:37:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 734 states have (on average 2.1403269754768393) internal successors, (1571), 1206 states have internal predecessors, (1571), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:37:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1630 transitions. [2023-12-02 15:37:45,731 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1630 transitions. Word has length 28 [2023-12-02 15:37:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:37:45,731 INFO L495 AbstractCegarLoop]: Abstraction has 1245 states and 1630 transitions. [2023-12-02 15:37:45,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:37:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1630 transitions. [2023-12-02 15:37:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 15:37:45,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:37:45,732 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:37:45,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 15:37:45,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-02 15:37:46,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2023-12-02 15:37:46,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:37:46,334 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:37:46,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:37:46,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2011652343, now seen corresponding path program 1 times [2023-12-02 15:37:46,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:37:46,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237613035] [2023-12-02 15:37:46,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:46,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:37:46,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:37:46,336 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:37:46,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-02 15:37:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:46,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:37:46,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:46,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:47,162 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:37:47,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237613035] [2023-12-02 15:37:47,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237613035] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:37:47,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [624179779] [2023-12-02 15:37:47,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:47,162 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:37:47,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:37:47,163 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:37:47,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-02 15:37:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:47,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:37:47,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:47,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:48,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [624179779] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:37:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521556691] [2023-12-02 15:37:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:48,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:37:48,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:37:48,039 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:37:48,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 15:37:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:48,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 15:37:48,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:48,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:37:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:48,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:54,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521556691] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:37:54,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:37:54,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11, 12] total 38 [2023-12-02 15:37:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337443122] [2023-12-02 15:37:54,357 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:37:54,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 15:37:54,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:37:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 15:37:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 15:37:54,359 INFO L87 Difference]: Start difference. First operand 1245 states and 1630 transitions. Second operand has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 15:38:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:38:56,786 INFO L93 Difference]: Finished difference Result 1265 states and 1651 transitions. [2023-12-02 15:38:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 15:38:56,788 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-12-02 15:38:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:38:56,794 INFO L225 Difference]: With dead ends: 1265 [2023-12-02 15:38:56,794 INFO L226 Difference]: Without dead ends: 1265 [2023-12-02 15:38:56,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=601, Invalid=1849, Unknown=0, NotChecked=0, Total=2450 [2023-12-02 15:38:56,795 INFO L413 NwaCegarLoop]: 1104 mSDtfsCounter, 42 mSDsluCounter, 8881 mSDsCounter, 0 mSdLazyCounter, 6043 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 9985 SdHoareTripleChecker+Invalid, 6062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 6043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:38:56,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 9985 Invalid, 6062 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 6043 Invalid, 0 Unknown, 0 Unchecked, 59.6s Time] [2023-12-02 15:38:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2023-12-02 15:38:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2023-12-02 15:38:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 754 states have (on average 2.1114058355437666) internal successors, (1592), 1226 states have internal predecessors, (1592), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:38:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1651 transitions. [2023-12-02 15:38:56,820 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1651 transitions. Word has length 28 [2023-12-02 15:38:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:38:56,821 INFO L495 AbstractCegarLoop]: Abstraction has 1265 states and 1651 transitions. [2023-12-02 15:38:56,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 15:38:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1651 transitions. [2023-12-02 15:38:56,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 15:38:56,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:38:56,822 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:38:56,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2023-12-02 15:38:57,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-02 15:38:57,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 15:38:57,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:38:57,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:38:57,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:38:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash -53251913, now seen corresponding path program 2 times [2023-12-02 15:38:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:38:57,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005627046] [2023-12-02 15:38:57,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:38:57,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:38:57,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:38:57,425 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:38:57,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-02 15:38:57,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 15:38:57,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:38:57,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 15:38:57,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:38:57,972 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 15:38:57,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2023-12-02 15:38:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:38:58,091 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:38:58,091 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:38:58,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005627046] [2023-12-02 15:38:58,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005627046] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:38:58,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:38:58,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:38:58,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790064383] [2023-12-02 15:38:58,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:38:58,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:38:58,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:38:58,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:38:58,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:38:58,093 INFO L87 Difference]: Start difference. First operand 1265 states and 1651 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:39:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:39:10,957 INFO L93 Difference]: Finished difference Result 1266 states and 1653 transitions. [2023-12-02 15:39:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:39:10,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-12-02 15:39:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:39:10,965 INFO L225 Difference]: With dead ends: 1266 [2023-12-02 15:39:10,965 INFO L226 Difference]: Without dead ends: 1266 [2023-12-02 15:39:10,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:39:10,966 INFO L413 NwaCegarLoop]: 1096 mSDtfsCounter, 930 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 4217 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:39:10,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 4217 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2023-12-02 15:39:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2023-12-02 15:39:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1264. [2023-12-02 15:39:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 754 states have (on average 2.110079575596817) internal successors, (1591), 1225 states have internal predecessors, (1591), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:39:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1650 transitions. [2023-12-02 15:39:10,992 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1650 transitions. Word has length 32 [2023-12-02 15:39:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:39:10,993 INFO L495 AbstractCegarLoop]: Abstraction has 1264 states and 1650 transitions. [2023-12-02 15:39:10,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:39:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1650 transitions. [2023-12-02 15:39:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 15:39:10,994 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:39:10,994 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:39:11,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-02 15:39:11,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:39:11,197 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:39:11,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:39:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 366358244, now seen corresponding path program 1 times [2023-12-02 15:39:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:39:11,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317359240] [2023-12-02 15:39:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:39:11,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:39:11,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:39:11,200 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:39:11,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-02 15:39:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:11,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:39:11,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:39:12,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:12,192 INFO L378 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 19 treesize of output 14 [2023-12-02 15:39:12,226 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:39:12,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 15:39:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:39:12,343 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:39:12,343 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:39:12,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317359240] [2023-12-02 15:39:12,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317359240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:39:12,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:39:12,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:39:12,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307220108] [2023-12-02 15:39:12,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:39:12,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:39:12,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:39:12,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:39:12,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:39:12,345 INFO L87 Difference]: Start difference. First operand 1264 states and 1650 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:39:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:39:24,505 INFO L93 Difference]: Finished difference Result 1279 states and 1666 transitions. [2023-12-02 15:39:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:39:24,505 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2023-12-02 15:39:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:39:24,510 INFO L225 Difference]: With dead ends: 1279 [2023-12-02 15:39:24,510 INFO L226 Difference]: Without dead ends: 1279 [2023-12-02 15:39:24,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:39:24,511 INFO L413 NwaCegarLoop]: 1082 mSDtfsCounter, 1914 mSDsluCounter, 3093 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 4175 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:39:24,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 4175 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2023-12-02 15:39:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2023-12-02 15:39:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1272. [2023-12-02 15:39:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 763 states have (on average 2.104849279161206) internal successors, (1606), 1233 states have internal predecessors, (1606), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:39:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1665 transitions. [2023-12-02 15:39:24,533 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1665 transitions. Word has length 34 [2023-12-02 15:39:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:39:24,534 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1665 transitions. [2023-12-02 15:39:24,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:39:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1665 transitions. [2023-12-02 15:39:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 15:39:24,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:39:24,535 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:39:24,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-02 15:39:24,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:39:24,739 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:39:24,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:39:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash -115213269, now seen corresponding path program 1 times [2023-12-02 15:39:24,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:39:24,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176190478] [2023-12-02 15:39:24,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:39:24,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:39:24,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:39:24,742 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:39:24,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-02 15:39:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:25,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:39:25,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:39:25,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 15:39:25,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:25,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-12-02 15:39:25,621 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:39:25,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 15:39:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:39:25,648 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:39:25,648 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:39:25,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176190478] [2023-12-02 15:39:25,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176190478] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:39:25,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:39:25,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:39:25,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531940977] [2023-12-02 15:39:25,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:39:25,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:39:25,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:39:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:39:25,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:39:25,650 INFO L87 Difference]: Start difference. First operand 1272 states and 1665 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:39:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:39:28,814 INFO L93 Difference]: Finished difference Result 1349 states and 1669 transitions. [2023-12-02 15:39:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:39:28,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-12-02 15:39:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:39:28,821 INFO L225 Difference]: With dead ends: 1349 [2023-12-02 15:39:28,821 INFO L226 Difference]: Without dead ends: 1349 [2023-12-02 15:39:28,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:39:28,821 INFO L413 NwaCegarLoop]: 969 mSDtfsCounter, 382 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:39:28,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1543 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-02 15:39:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-12-02 15:39:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1271. [2023-12-02 15:39:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 763 states have (on average 2.1022280471821757) internal successors, (1604), 1232 states have internal predecessors, (1604), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:39:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1663 transitions. [2023-12-02 15:39:28,837 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1663 transitions. Word has length 36 [2023-12-02 15:39:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:39:28,838 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 1663 transitions. [2023-12-02 15:39:28,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:39:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1663 transitions. [2023-12-02 15:39:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 15:39:28,839 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:39:28,839 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:39:28,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-02 15:39:29,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:39:29,040 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:39:29,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:39:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash -115213268, now seen corresponding path program 1 times [2023-12-02 15:39:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:39:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208634731] [2023-12-02 15:39:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:39:29,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:39:29,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:39:29,042 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:39:29,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-02 15:39:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:29,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 15:39:29,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:39:29,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-12-02 15:39:29,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:39:29,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 15:39:29,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2023-12-02 15:39:30,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:39:30,227 INFO L378 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 19 treesize of output 14 [2023-12-02 15:39:30,272 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:39:30,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 15:39:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:39:30,414 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:39:30,415 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:39:30,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208634731] [2023-12-02 15:39:30,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208634731] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:39:30,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:39:30,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:39:30,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194534827] [2023-12-02 15:39:30,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:39:30,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:39:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:39:30,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:39:30,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:39:30,416 INFO L87 Difference]: Start difference. First operand 1271 states and 1663 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:39:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:39:54,566 INFO L93 Difference]: Finished difference Result 1354 states and 1669 transitions. [2023-12-02 15:39:54,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:39:54,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-12-02 15:39:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:39:54,573 INFO L225 Difference]: With dead ends: 1354 [2023-12-02 15:39:54,573 INFO L226 Difference]: Without dead ends: 1354 [2023-12-02 15:39:54,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:39:54,574 INFO L413 NwaCegarLoop]: 881 mSDtfsCounter, 1530 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 3869 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:39:54,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 3869 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 23.9s Time] [2023-12-02 15:39:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2023-12-02 15:39:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1271. [2023-12-02 15:39:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 763 states have (on average 2.1009174311926606) internal successors, (1603), 1232 states have internal predecessors, (1603), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:39:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1662 transitions. [2023-12-02 15:39:54,590 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1662 transitions. Word has length 36 [2023-12-02 15:39:54,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:39:54,591 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 1662 transitions. [2023-12-02 15:39:54,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:39:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1662 transitions. [2023-12-02 15:39:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:39:54,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:39:54,592 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:39:54,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-12-02 15:39:54,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:39:54,793 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:39:54,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:39:54,793 INFO L85 PathProgramCache]: Analyzing trace with hash 951026125, now seen corresponding path program 1 times [2023-12-02 15:39:54,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:39:54,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621976242] [2023-12-02 15:39:54,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:39:54,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:39:54,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:39:54,795 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:39:54,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-02 15:39:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:39:55,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 15:39:55,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:39:55,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 15:39:55,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 15:39:55,899 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 15:39:55,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2023-12-02 15:39:55,989 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 15:39:55,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 14 [2023-12-02 15:39:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:39:56,021 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:39:56,021 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:39:56,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621976242] [2023-12-02 15:39:56,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621976242] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:39:56,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:39:56,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:39:56,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233073005] [2023-12-02 15:39:56,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:39:56,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:39:56,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:39:56,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:39:56,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:39:56,023 INFO L87 Difference]: Start difference. First operand 1271 states and 1662 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:40:07,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:40:09,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 15:40:11,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:40:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:40:16,468 INFO L93 Difference]: Finished difference Result 1269 states and 1659 transitions. [2023-12-02 15:40:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:40:16,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2023-12-02 15:40:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:40:16,473 INFO L225 Difference]: With dead ends: 1269 [2023-12-02 15:40:16,473 INFO L226 Difference]: Without dead ends: 1269 [2023-12-02 15:40:16,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:40:16,474 INFO L413 NwaCegarLoop]: 1090 mSDtfsCounter, 921 mSDsluCounter, 2962 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 4052 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:40:16,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 4052 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2295 Invalid, 3 Unknown, 0 Unchecked, 20.3s Time] [2023-12-02 15:40:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2023-12-02 15:40:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1269. [2023-12-02 15:40:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 763 states have (on average 2.0969855832241153) internal successors, (1600), 1230 states have internal predecessors, (1600), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:40:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1659 transitions. [2023-12-02 15:40:16,495 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1659 transitions. Word has length 38 [2023-12-02 15:40:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:40:16,496 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 1659 transitions. [2023-12-02 15:40:16,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:40:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1659 transitions. [2023-12-02 15:40:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:40:16,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:40:16,497 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:40:16,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-12-02 15:40:16,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:40:16,698 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:40:16,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:40:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash 951026126, now seen corresponding path program 1 times [2023-12-02 15:40:16,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:40:16,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218768724] [2023-12-02 15:40:16,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:16,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:40:16,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:40:16,700 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:40:16,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-02 15:40:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:17,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 15:40:17,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:40:17,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 15:40:17,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:40:17,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-02 15:40:17,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-12-02 15:40:17,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-12-02 15:40:17,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-12-02 15:40:17,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2023-12-02 15:40:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:40:17,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:40:17,896 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:40:17,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218768724] [2023-12-02 15:40:17,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218768724] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:40:17,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:40:17,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:40:17,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790101564] [2023-12-02 15:40:17,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:40:17,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:40:17,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:40:17,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:40:17,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:40:17,898 INFO L87 Difference]: Start difference. First operand 1269 states and 1659 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:40:28,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:40:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:40:32,783 INFO L93 Difference]: Finished difference Result 1268 states and 1657 transitions. [2023-12-02 15:40:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:40:32,784 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2023-12-02 15:40:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:40:32,788 INFO L225 Difference]: With dead ends: 1268 [2023-12-02 15:40:32,788 INFO L226 Difference]: Without dead ends: 1268 [2023-12-02 15:40:32,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:40:32,789 INFO L413 NwaCegarLoop]: 1083 mSDtfsCounter, 925 mSDsluCounter, 2167 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 3250 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:40:32,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 3250 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1599 Invalid, 1 Unknown, 0 Unchecked, 14.8s Time] [2023-12-02 15:40:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2023-12-02 15:40:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1268. [2023-12-02 15:40:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 763 states have (on average 2.094364351245085) internal successors, (1598), 1229 states have internal predecessors, (1598), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:40:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1657 transitions. [2023-12-02 15:40:32,808 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1657 transitions. Word has length 38 [2023-12-02 15:40:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:40:32,808 INFO L495 AbstractCegarLoop]: Abstraction has 1268 states and 1657 transitions. [2023-12-02 15:40:32,808 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:40:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1657 transitions. [2023-12-02 15:40:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 15:40:32,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:40:32,809 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:40:32,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-12-02 15:40:33,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:40:33,010 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:40:33,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:40:33,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1823375142, now seen corresponding path program 1 times [2023-12-02 15:40:33,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:40:33,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166407617] [2023-12-02 15:40:33,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:33,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:40:33,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:40:33,012 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:40:33,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-02 15:40:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:33,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 15:40:33,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:40:33,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 15:40:34,052 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:40:34,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 15:40:34,140 INFO L378 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 25 treesize of output 1 [2023-12-02 15:40:34,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-12-02 15:40:34,498 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-12-02 15:40:34,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-12-02 15:40:34,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-12-02 15:40:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:40:34,662 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:40:34,662 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:40:34,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166407617] [2023-12-02 15:40:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166407617] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:40:34,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:40:34,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:40:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217974296] [2023-12-02 15:40:34,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:40:34,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:40:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:40:34,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:40:34,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:40:34,664 INFO L87 Difference]: Start difference. First operand 1268 states and 1657 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:40:49,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:40:51,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:40:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:40:56,967 INFO L93 Difference]: Finished difference Result 1355 states and 1675 transitions. [2023-12-02 15:40:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:40:56,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2023-12-02 15:40:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:40:56,973 INFO L225 Difference]: With dead ends: 1355 [2023-12-02 15:40:56,973 INFO L226 Difference]: Without dead ends: 1355 [2023-12-02 15:40:56,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:40:56,973 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1119 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 2543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:40:56,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 3998 Invalid, 2543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2531 Invalid, 2 Unknown, 0 Unchecked, 22.1s Time] [2023-12-02 15:40:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2023-12-02 15:40:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1274. [2023-12-02 15:40:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 769 states have (on average 2.092327698309493) internal successors, (1609), 1235 states have internal predecessors, (1609), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:40:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1668 transitions. [2023-12-02 15:40:56,991 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1668 transitions. Word has length 41 [2023-12-02 15:40:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:40:56,991 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1668 transitions. [2023-12-02 15:40:56,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:40:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1668 transitions. [2023-12-02 15:40:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 15:40:56,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:40:56,992 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:40:57,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-02 15:40:57,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:40:57,193 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:40:57,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:40:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1823375141, now seen corresponding path program 1 times [2023-12-02 15:40:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:40:57,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811890985] [2023-12-02 15:40:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:40:57,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:40:57,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:40:57,195 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:40:57,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-02 15:40:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:40:58,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 15:40:58,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:40:58,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 15:40:58,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:40:58,366 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:40:58,366 INFO L378 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 13 treesize of output 13 [2023-12-02 15:40:58,448 INFO L378 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 25 treesize of output 1 [2023-12-02 15:40:58,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-02 15:40:58,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-12-02 15:40:58,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-12-02 15:40:58,807 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-12-02 15:40:58,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-12-02 15:40:58,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-12-02 15:40:58,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-12-02 15:40:58,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2023-12-02 15:40:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:40:59,033 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:40:59,033 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:40:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811890985] [2023-12-02 15:40:59,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811890985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:40:59,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:40:59,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 15:40:59,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233053910] [2023-12-02 15:40:59,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:40:59,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 15:40:59,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:40:59,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 15:40:59,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:40:59,034 INFO L87 Difference]: Start difference. First operand 1274 states and 1668 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:41:16,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:41:18,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:41:20,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:41:22,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:41:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:41:29,553 INFO L93 Difference]: Finished difference Result 1353 states and 1670 transitions. [2023-12-02 15:41:29,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 15:41:29,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2023-12-02 15:41:29,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:41:29,559 INFO L225 Difference]: With dead ends: 1353 [2023-12-02 15:41:29,559 INFO L226 Difference]: Without dead ends: 1353 [2023-12-02 15:41:29,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:41:29,560 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1110 mSDsluCounter, 3888 mSDsCounter, 0 mSdLazyCounter, 3731 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 4840 SdHoareTripleChecker+Invalid, 3747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3731 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:41:29,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 4840 Invalid, 3747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3731 Invalid, 4 Unknown, 0 Unchecked, 30.0s Time] [2023-12-02 15:41:29,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2023-12-02 15:41:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1274. [2023-12-02 15:41:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 769 states have (on average 2.0871261378413526) internal successors, (1605), 1235 states have internal predecessors, (1605), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:41:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1664 transitions. [2023-12-02 15:41:29,575 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1664 transitions. Word has length 41 [2023-12-02 15:41:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:41:29,576 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1664 transitions. [2023-12-02 15:41:29,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:41:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1664 transitions. [2023-12-02 15:41:29,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 15:41:29,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:41:29,576 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:41:29,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-12-02 15:41:29,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:41:29,777 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:41:29,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:41:29,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1663914797, now seen corresponding path program 1 times [2023-12-02 15:41:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:41:29,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581065845] [2023-12-02 15:41:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:41:29,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:41:29,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:41:29,779 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:41:29,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-02 15:41:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:41:31,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 15:41:31,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:41:31,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 15:41:31,244 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:41:31,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 15:41:31,354 INFO L378 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 25 treesize of output 1 [2023-12-02 15:41:31,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-12-02 15:41:31,707 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-12-02 15:41:31,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-12-02 15:41:31,913 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-12-02 15:41:31,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-12-02 15:41:31,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-12-02 15:41:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-12-02 15:41:32,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:41:32,448 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1768) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:41:32,490 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem298#1.base| v_ArrVal_1767))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1768)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:41:32,522 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1767))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1768)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:41:32,560 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1766 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1766))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1767)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1768)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:41:32,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:41:32,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 78 [2023-12-02 15:41:32,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10773 treesize of output 8622 [2023-12-02 15:41:32,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2344 treesize of output 2008 [2023-12-02 15:41:32,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2008 treesize of output 1847 [2023-12-02 15:41:32,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1847 treesize of output 1546 [2023-12-02 15:41:41,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:41:41,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 290 [2023-12-02 15:41:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 2 not checked. [2023-12-02 15:41:43,838 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:41:43,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581065845] [2023-12-02 15:41:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581065845] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:41:43,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2079946027] [2023-12-02 15:41:43,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:41:43,839 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:41:43,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:41:43,840 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:41:43,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-12-02 15:41:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:41:48,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 15:41:48,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:41:48,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 15:41:48,460 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:41:48,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 15:41:48,638 INFO L378 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 21 treesize of output 1 [2023-12-02 15:41:48,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2023-12-02 15:41:49,317 INFO L349 Elim1Store]: treesize reduction 44, result has 18.5 percent of original size [2023-12-02 15:41:49,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 40 [2023-12-02 15:41:49,565 INFO L349 Elim1Store]: treesize reduction 22, result has 18.5 percent of original size [2023-12-02 15:41:49,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2023-12-02 15:41:49,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-12-02 15:41:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-12-02 15:41:49,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:41:49,693 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1897 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem300#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 15:41:49,723 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1897 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1897) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-12-02 15:41:49,787 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem298#1.offset| (_ BitVec 64)) (v_ArrVal_1897 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1895 (_ BitVec 64))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem298#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem298#1.base|) (bvadd (_ bv10 64) |ULTIMATE.start_main_#t~mem298#1.offset|) v_ArrVal_1895)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1897)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 15:41:49,857 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem298#1.offset| (_ BitVec 64)) (v_ArrVal_1897 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1895 (_ BitVec 64))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd (_ bv10 64) |ULTIMATE.start_main_#t~mem298#1.offset|) v_ArrVal_1895))))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1897)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:41:49,911 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem298#1.offset| (_ BitVec 64)) (v_ArrVal_1897 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1895 (_ BitVec 64)) (v_ArrVal_1893 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1893))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (bvadd (_ bv10 64) |ULTIMATE.start_main_#t~mem298#1.offset|) v_ArrVal_1895)))))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1897)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:41:49,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:41:49,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 122 [2023-12-02 15:41:50,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:41:50,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 5493 treesize of output 4944 [2023-12-02 15:41:50,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 638 treesize of output 610 [2023-12-02 15:41:50,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 885 treesize of output 724 [2023-12-02 15:41:55,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 686 treesize of output 595 [2023-12-02 15:41:59,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:41:59,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 290 [2023-12-02 15:42:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 3 not checked. [2023-12-02 15:42:02,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2079946027] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:42:02,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698379707] [2023-12-02 15:42:02,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:42:02,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:42:02,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:42:02,049 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:42:02,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-12-02 15:42:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:42:02,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 15:42:02,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:42:02,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 15:42:02,675 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:42:02,675 INFO L378 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 13 treesize of output 13 [2023-12-02 15:42:02,817 INFO L378 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 25 treesize of output 1 [2023-12-02 15:42:02,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 15:42:03,256 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-12-02 15:42:03,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2023-12-02 15:42:03,460 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-12-02 15:42:03,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-12-02 15:42:03,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-12-02 15:42:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:42:03,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:42:03,709 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2023-12-02 15:42:03,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2023-12-02 15:42:03,727 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_#t~mem300#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem300#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|)))) is different from false [2023-12-02 15:42:03,750 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2023) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))) is different from false [2023-12-02 15:42:03,786 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2022 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem298#1.base| v_ArrVal_2022)) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2023) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 15:42:03,814 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2022 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2022))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2023) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-12-02 15:42:03,845 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2022 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2021 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2021))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2022)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2023) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 15:42:03,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:42:03,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 101 [2023-12-02 15:42:03,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16101 treesize of output 11898 [2023-12-02 15:42:03,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 613 treesize of output 529 [2023-12-02 15:42:03,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 529 treesize of output 375 [2023-12-02 15:42:03,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 277 [2023-12-02 15:42:06,276 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-12-02 15:42:06,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2023-12-02 15:42:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 3 not checked. [2023-12-02 15:42:06,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698379707] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:42:06,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:42:06,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10, 11, 10, 11] total 43 [2023-12-02 15:42:06,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153438897] [2023-12-02 15:42:06,281 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:42:06,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-02 15:42:06,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:42:06,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-02 15:42:06,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=716, Unknown=18, NotChecked=966, Total=1892 [2023-12-02 15:42:06,284 INFO L87 Difference]: Start difference. First operand 1274 states and 1664 transitions. Second operand has 44 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 44 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:42:33,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:42:35,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:42:37,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:42:39,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:42:41,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:42:43,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:42:45,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:42:47,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 15:42:49,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:42:51,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:42:53,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:43:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:43:04,940 INFO L93 Difference]: Finished difference Result 1353 states and 1669 transitions. [2023-12-02 15:43:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:43:04,941 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 44 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-12-02 15:43:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:43:04,946 INFO L225 Difference]: With dead ends: 1353 [2023-12-02 15:43:04,946 INFO L226 Difference]: Without dead ends: 1353 [2023-12-02 15:43:04,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 215 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=315, Invalid=1055, Unknown=18, NotChecked=1162, Total=2550 [2023-12-02 15:43:04,947 INFO L413 NwaCegarLoop]: 951 mSDtfsCounter, 2662 mSDsluCounter, 10888 mSDsCounter, 0 mSdLazyCounter, 6070 mSolverCounterSat, 38 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2671 SdHoareTripleChecker+Valid, 11839 SdHoareTripleChecker+Invalid, 23241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 6070 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 17122 IncrementalHoareTripleChecker+Unchecked, 55.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:43:04,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2671 Valid, 11839 Invalid, 23241 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 6070 Invalid, 11 Unknown, 17122 Unchecked, 55.9s Time] [2023-12-02 15:43:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2023-12-02 15:43:04,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1273. [2023-12-02 15:43:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 769 states have (on average 2.084525357607282) internal successors, (1603), 1234 states have internal predecessors, (1603), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-02 15:43:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1662 transitions. [2023-12-02 15:43:04,962 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1662 transitions. Word has length 44 [2023-12-02 15:43:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:43:04,962 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1662 transitions. [2023-12-02 15:43:04,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 44 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:43:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1662 transitions. [2023-12-02 15:43:04,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 15:43:04,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:43:04,962 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:43:04,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-02 15:43:05,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-12-02 15:43:05,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2023-12-02 15:43:05,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:43:05,564 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 485 more)] === [2023-12-02 15:43:05,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:43:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1663914796, now seen corresponding path program 1 times [2023-12-02 15:43:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:43:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381181491] [2023-12-02 15:43:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:43:05,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:43:05,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:43:05,566 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:43:05,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-02 15:43:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:43:06,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 15:43:06,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:43:06,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-02 15:43:06,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:43:06,797 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:43:06,798 INFO L378 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 13 treesize of output 13 [2023-12-02 15:43:06,877 INFO L378 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 25 treesize of output 1 [2023-12-02 15:43:06,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-02 15:43:07,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-12-02 15:43:07,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-12-02 15:43:07,331 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-12-02 15:43:07,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-12-02 15:43:07,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-12-02 15:43:07,697 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-12-02 15:43:07,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-12-02 15:43:07,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-12-02 15:43:07,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-12-02 15:43:07,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2023-12-02 15:43:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-12-02 15:43:07,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:43:08,740 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2154 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem300#1.base| v_ArrVal_2154) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_2155 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2154 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem300#1.base| v_ArrVal_2154) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem300#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-12-02 15:43:08,862 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2154 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2154) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_2155 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2154 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2154) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2155) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-12-02 15:43:09,060 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2154 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2153 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2152 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem298#1.base| v_ArrVal_2153) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem298#1.base| v_ArrVal_2152) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2154) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_2155 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2154 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2153 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2152 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem298#1.base| v_ArrVal_2152))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem298#1.base| v_ArrVal_2153) .cse3 v_ArrVal_2154) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2155) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-12-02 15:43:09,225 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 ((_ sign_extend 32) (_ bv1 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2155 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2154 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2153 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2152 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2152))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2153) .cse1 v_ArrVal_2154) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse3 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_2155) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2154 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2153 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2152 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2153) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2152) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2154) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv1 64)))))))) is different from false [2023-12-02 15:43:09,380 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2155 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2154 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2151 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2150 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2153 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2152 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2151))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2152))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2150) .cse1 v_ArrVal_2153) .cse2 v_ArrVal_2154) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2155) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2154 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2151 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2150 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2153 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2152 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2151))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2150) .cse7 v_ArrVal_2153) (select (select (store .cse8 .cse7 v_ArrVal_2152) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2154))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse6) (bvadd .cse0 (_ bv1 64) .cse6)))))) is different from false [2023-12-02 15:43:09,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:43:09,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2023-12-02 15:43:09,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:43:09,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2023-12-02 15:43:09,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60219 treesize of output 51660 [2023-12-02 15:43:09,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120180 treesize of output 115995 [2023-12-02 15:43:10,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6935 treesize of output 6347 [2023-12-02 15:43:10,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6347 treesize of output 5955 [2023-12-02 15:43:10,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5955 treesize of output 4709 [2023-12-02 15:43:10,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4709 treesize of output 4317 [2023-12-02 15:43:10,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4317 treesize of output 3659 [2023-12-02 15:43:10,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3659 treesize of output 3491 [2023-12-02 15:47:37,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:47:37,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 216 [2023-12-02 15:47:37,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:47:37,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 138 [2023-12-02 15:47:37,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1481 treesize of output 1238 [2023-12-02 15:47:37,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2932 treesize of output 2707 [2023-12-02 15:47:37,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 959 treesize of output 875 [2023-12-02 15:47:37,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 875 treesize of output 707 [2023-12-02 15:47:37,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 707 treesize of output 651 [2023-12-02 15:47:37,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 651 treesize of output 567 [2023-12-02 15:47:37,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 567 treesize of output 511 [2023-12-02 15:47:39,295 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-12-02 15:47:39,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2023-12-02 15:47:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 3 not checked. [2023-12-02 15:47:39,300 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:47:39,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381181491] [2023-12-02 15:47:39,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381181491] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:47:39,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [541184221] [2023-12-02 15:47:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:47:39,300 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:47:39,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:47:39,301 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:47:39,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b79795ad-95cb-4a3a-8754-ece2e61e0102/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-12-02 15:47:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:47:45,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 15:47:45,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:47:46,223 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 15:47:46,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2023-12-02 15:47:46,310 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:47:46,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-12-02 15:47:47,030 INFO L349 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-12-02 15:47:47,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 27 treesize of output 40 [2023-12-02 15:47:47,234 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-12-02 15:47:47,234 INFO L378 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 20 treesize of output 22 [2023-12-02 15:47:47,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 15:47:48,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-12-02 15:47:48,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 15:47:49,966 INFO L349 Elim1Store]: treesize reduction 45, result has 40.0 percent of original size [2023-12-02 15:47:49,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 76 [2023-12-02 15:47:50,030 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:47:50,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2023-12-02 15:47:50,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2023-12-02 15:47:52,091 INFO L349 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2023-12-02 15:47:52,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 58 [2023-12-02 15:47:52,163 INFO L349 Elim1Store]: treesize reduction 23, result has 37.8 percent of original size [2023-12-02 15:47:52,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 74 [2023-12-02 15:47:52,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-12-02 15:47:53,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 26 [2023-12-02 15:47:53,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2023-12-02 15:47:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:47:53,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:47:54,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~j~0#1|))) (let ((.cse1 (bvadd .cse0 (_ bv1 64) |c_ULTIMATE.start_main_#t~mem300#1.offset|))) (or (not (bvule (bvadd .cse0 |c_ULTIMATE.start_main_#t~mem300#1.offset|) .cse1)) (let ((.cse3 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2290 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem300#1.base| v_ArrVal_2290) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse2 .cse3) (bvadd .cse2 (_ bv1 64) .cse3)))) (forall ((v_ArrVal_2290 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem300#1.base| v_ArrVal_2290) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64) .cse3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem300#1.base| v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_main_#t~mem300#1.base|)))))) is different from false [2023-12-02 15:48:20,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3802 treesize of output 3523 [2023-12-02 15:48:20,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1067 treesize of output 997 [2023-12-02 15:48:21,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 845 treesize of output 761 [2023-12-02 15:48:21,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 498 treesize of output 442 [2023-12-02 15:48:28,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7282 treesize of output 6751 [2023-12-02 15:48:28,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1329 treesize of output 1196 [2023-12-02 15:48:28,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1284 treesize of output 1256 [2023-12-02 15:48:28,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1734 treesize of output 1678 [2023-12-02 15:50:54,541 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (= |c_ULTIMATE.start_main_~argv~0#1.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|))) (let ((.cse299 (not .cse15)) (.cse11 ((_ sign_extend 32) (_ bv1 32))) (.cse2 ((_ sign_extend 32) (_ bv0 32))) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (or (and (forall ((v_arrayElimCell_130 (_ BitVec 64))) (let ((.cse0 (bvadd (_ bv10 64) v_arrayElimCell_130)) (.cse1 (bvadd v_arrayElimCell_130 (_ bv11 64)))) (or (not (bvule .cse0 .cse1)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_131 (_ BitVec 64))) (let ((.cse3 (bvadd .cse2 v_arrayElimCell_131 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_131) .cse3)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse4 (select (select (store .cse5 .cse6 (store (select .cse5 .cse6) .cse0 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse3 (select |c_#length| .cse4))) (not (= .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))) (not (= .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|)) (not (bvule .cse1 (select |c_#length| .cse6)))))))))) (forall ((v_arrayElimCell_130 (_ BitVec 64))) (let ((.cse8 (bvadd (_ bv10 64) v_arrayElimCell_130)) (.cse9 (bvadd v_arrayElimCell_130 (_ bv11 64)))) (or (not (bvule .cse8 .cse9)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (= .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_131 (_ BitVec 64))) (or (bvule (bvadd v_arrayElimCell_131 .cse11) (bvadd v_arrayElimCell_131 .cse11 (_ bv1 64))) (forall ((v_ArrVal_2288 (_ BitVec 64))) (not (bvule (bvadd .cse2 v_arrayElimCell_131 (_ bv1 64)) (select |c_#length| (select (select (store .cse12 .cse10 (store (select .cse12 .cse10) .cse8 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))) (not (bvule .cse9 (select |c_#length| .cse10)))))))))) (forall ((v_arrayElimCell_130 (_ BitVec 64))) (or (bvule (bvadd v_arrayElimCell_130 .cse11) (bvadd v_arrayElimCell_130 .cse11 (_ bv1 64))) (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_130 (_ bv1 64)) (select |c_#length| (select (select (store .cse13 .cse14 (store (select .cse13 .cse14) (bvadd (_ bv10 64) v_arrayElimCell_130) v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (= .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))) .cse15) (or (and (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse17 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse16 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse16 .cse17)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse18 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse17 (select |c_#length| .cse18))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse19 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse22 (store .cse23 .cse18 (store (select .cse23 .cse18) .cse16 v_ArrVal_2288)))) (let ((.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse19 (select |c_#length| .cse20))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse21 (select |c_#length| (select (select (store .cse22 .cse20 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse21) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse21)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse21)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse19))))) (not (= .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse24 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse25 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse24 .cse25)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse28 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse32 (select .cse30 .cse31))) (let ((.cse26 (store .cse30 .cse31 (store .cse32 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse29 (select (select (store .cse30 .cse31 (store .cse32 .cse24 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse26 .cse27 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (not (bvule .cse28 (select |c_#length| .cse29))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse27)) (not (= .cse29 |c_ULTIMATE.start_main_~argv~0#1.base|))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse28))))) (not (bvule .cse25 (select |c_#length| .cse31))) (not (= .cse31 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse34 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse33 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse33 .cse34)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse35 (select (select .cse41 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse34 (select |c_#length| .cse35))) (not (= .cse35 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse37 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse42 (select .cse41 .cse35))) (let ((.cse40 (store .cse41 .cse35 (store .cse42 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse38 (select (select (store .cse41 .cse35 (store .cse42 .cse33 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse36 (select (select .cse40 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse36) (not (bvule .cse37 (select |c_#length| .cse38))) (= .cse38 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse39 (select |c_#length| (select (select (store .cse40 .cse36 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse39) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse39))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse37)))))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse45 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64))) (.cse43 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse44 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse43 .cse44)) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse45)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse50 (select (select .cse49 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse48 (store .cse49 .cse50 (store (select .cse49 .cse50) .cse43 v_ArrVal_2288)))) (let ((.cse46 (select (select .cse48 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse45 (select |c_#length| .cse46))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse47 (select |c_#length| (select (select (store .cse48 .cse46 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse47) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse47)))))))) (not (bvule .cse44 (select |c_#length| .cse50))) (= .cse50 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse52 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse51 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse59 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (not (bvule .cse51 .cse52)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse53 (select (select .cse55 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse52 (select |c_#length| .cse53))) (= .cse53 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse56 (select .cse55 .cse53))) (let ((.cse57 (store .cse55 .cse53 (store .cse56 .cse51 v_ArrVal_2288)))) (let ((.cse58 (select (select .cse57 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse54 (store .cse55 .cse53 (store .cse56 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse54 (select (select .cse54 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse57 .cse58 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))) (not (bvule .cse59 (select |c_#length| .cse58)))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse59))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse61 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse62 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64))) (.cse60 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse60 .cse61)) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse62)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse63 (select (select .cse69 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse61 (select |c_#length| .cse63))) (= .cse63 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse70 (select .cse69 .cse63))) (let ((.cse66 (store .cse69 .cse63 (store .cse70 .cse60 v_ArrVal_2288)))) (let ((.cse67 (select (select .cse66 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse64 (select |c_#length| (select (select (let ((.cse68 (store .cse69 .cse63 (store .cse70 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse68 (select (select .cse68 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse65 (select |c_#length| (select (select (store .cse66 .cse67 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse64) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse64) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse65)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse65)))) (not (bvule .cse62 (select |c_#length| .cse67))))))))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse72 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse71 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse71 .cse72)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse73 (select (select .cse79 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse72 (select |c_#length| .cse73))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse78 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse80 (select .cse79 .cse73))) (let ((.cse76 (store .cse79 .cse73 (store .cse80 .cse71 v_ArrVal_2288))) (.cse74 (store .cse79 .cse73 (store .cse80 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse75 (select (select .cse74 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse77 (select (select .cse76 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse74 .cse75 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse76 .cse77 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse75) (not (bvule .cse78 (select |c_#length| .cse77)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse78))))) (not (= .cse73 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse82 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse81 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse81 .cse82)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse91 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse83 (select (select .cse91 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse82 (select |c_#length| .cse83))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse90 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse92 (select .cse91 .cse83))) (let ((.cse86 (store .cse91 .cse83 (store .cse92 .cse81 v_ArrVal_2288))) (.cse88 (store .cse91 .cse83 (store .cse92 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse89 (select (select .cse88 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse87 (select (select .cse86 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse84 (select |c_#length| (select (select (store .cse88 .cse89 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse85 (select |c_#length| (select (select (store .cse86 .cse87 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse84) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse84) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse85)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse85)))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse89) (not (bvule .cse90 (select |c_#length| .cse87)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse90))))) (not (= .cse83 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse102 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse93 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse100 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse94 (select (select .cse100 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse93 (select |c_#length| .cse94))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse99 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse101 (select .cse100 .cse94))) (let ((.cse95 (store .cse100 .cse94 (store .cse101 .cse102 v_ArrVal_2288))) (.cse97 (store .cse100 .cse94 (store .cse101 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse98 (select (select .cse97 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse96 (select (select .cse95 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse95 .cse96 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse97 .cse98 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))) (not (bvule .cse99 (select |c_#length| .cse96))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse98)) (= .cse96 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse99))))) (not (= .cse94 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule .cse102 .cse93))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse113 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse103 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse110 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse104 (select (select .cse110 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse103 (select |c_#length| .cse104))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse112 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse111 (select .cse110 .cse104))) (let ((.cse107 (store .cse110 .cse104 (store .cse111 .cse113 v_ArrVal_2288)))) (let ((.cse108 (select (select .cse107 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse105 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse106 (select |c_#length| (select (select (let ((.cse109 (store .cse110 .cse104 (store .cse111 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse109 (select (select .cse109 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse105 .cse106) (bvule .cse105 (select |c_#length| (select (select (store .cse107 .cse108 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse106)))) (not (bvule .cse112 (select |c_#length| .cse108))) (= .cse108 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse112))))) (not (= .cse104 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule .cse113 .cse103))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse115 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse114 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse117 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (not (bvule .cse114 .cse115)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse120 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse116 (select (select .cse120 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse115 (select |c_#length| .cse116))) (= .cse116 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse121 (select .cse120 .cse116))) (let ((.cse123 (store .cse120 .cse116 (store .cse121 .cse114 v_ArrVal_2288)))) (let ((.cse118 (select (select .cse123 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse117 (select |c_#length| .cse118))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse122 (select |c_#length| (select (select (store .cse123 .cse118 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse119 (store .cse120 .cse116 (store .cse121 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse119 (select (select .cse119 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse122)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse122))))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse117))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse130 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse124 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse129 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse125 (select (select .cse129 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse124 (select |c_#length| .cse125))) (not (= .cse125 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse126 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse128 (store .cse129 .cse125 (store (select .cse129 .cse125) .cse130 v_ArrVal_2288)))) (let ((.cse127 (select (select .cse128 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse126 (select |c_#length| .cse127))) (= .cse127 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse128 .cse127 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse126))))))))) (not (bvule .cse130 .cse124))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse131 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse132 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse133 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (not (bvule .cse131 .cse132)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse137 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse138 (select (select .cse137 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse136 (store .cse137 .cse138 (store (select .cse137 .cse138) .cse131 v_ArrVal_2288)))) (let ((.cse134 (select (select .cse136 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse133 (select |c_#length| .cse134))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse135 (select |c_#length| (select (select (store .cse136 .cse134 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse135) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse135)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse135)))))))) (not (bvule .cse132 (select |c_#length| .cse138))) (= .cse138 |c_ULTIMATE.start_main_~argv~0#1.base|))))) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse133))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse140 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse139 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse139 .cse140)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse149 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse141 (select (select .cse149 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse140 (select |c_#length| .cse141))) (not (= .cse141 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse142 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse150 (select .cse149 .cse141))) (let ((.cse148 (store .cse149 .cse141 (store .cse150 .cse139 v_ArrVal_2288))) (.cse147 (store .cse149 .cse141 (store .cse150 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse144 (select (select .cse147 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse143 (select (select .cse148 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse142 (select |c_#length| .cse143))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse144)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse146 (select |c_#length| (select (select (store .cse148 .cse143 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse145 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse145 .cse146) (bvule .cse145 (select |c_#length| (select (select (store .cse147 .cse144 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse146))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse142)))))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse161 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse151 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse159 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse152 (select (select .cse159 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse151 (select |c_#length| .cse152))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse153 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse153)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse160 (select .cse159 .cse152))) (let ((.cse156 (store .cse159 .cse152 (store .cse160 .cse161 v_ArrVal_2288)))) (let ((.cse154 (select (select .cse156 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse153 (select |c_#length| .cse154))) (not (= .cse154 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse155 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64))) (.cse157 (select |c_#length| (select (select (let ((.cse158 (store .cse159 .cse152 (store .cse160 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse158 (select (select .cse158 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse155 (select |c_#length| (select (select (store .cse156 .cse154 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse157) (bvule .cse155 .cse157)))))))))))) (not (= .cse152 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule .cse161 .cse151))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse171 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse162 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse164 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse169 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse163 (select (select .cse169 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse162 (select |c_#length| .cse163))) (= .cse163 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse170 (select .cse169 .cse163))) (let ((.cse167 (store .cse169 .cse163 (store .cse170 .cse171 v_ArrVal_2288)))) (let ((.cse165 (select (select .cse167 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse164 (select |c_#length| .cse165))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse166 (select |c_#length| (select (select (let ((.cse168 (store .cse169 .cse163 (store .cse170 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse168 (select (select .cse168 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse166) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse166) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse167 .cse165 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))))))))) (not (bvule .cse171 .cse162)) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse164))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse173 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse172 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse172 .cse173)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse181 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse174 (select (select .cse181 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse173 (select |c_#length| .cse174))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse175 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse182 (select .cse181 .cse174))) (let ((.cse178 (store .cse181 .cse174 (store .cse182 .cse172 v_ArrVal_2288)))) (let ((.cse176 (select (select .cse178 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse175 (select |c_#length| .cse176))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse177 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64))) (.cse179 (select |c_#length| (select (select (let ((.cse180 (store .cse181 .cse174 (store .cse182 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse180 (select (select .cse180 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse177 (select |c_#length| (select (select (store .cse178 .cse176 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse179) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse179) (bvule .cse177 .cse179)))) (not (= .cse176 |c_ULTIMATE.start_main_~argv~0#1.base|))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse175))))) (not (= .cse174 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse183 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse184 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse183 .cse184)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse192 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse193 (select (select .cse192 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse195 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse194 (select .cse192 .cse193))) (let ((.cse189 (store .cse192 .cse193 (store .cse194 .cse183 v_ArrVal_2288)))) (let ((.cse190 (select (select .cse189 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse186 (select |c_#length| (select (select (let ((.cse191 (store .cse192 .cse193 (store .cse194 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse191 (select (select .cse191 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse185 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse188 (select |c_#length| (select (select (store .cse189 .cse190 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse185 .cse186) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse187 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse187 .cse188) (bvule .cse187 .cse186)))) (bvule .cse185 .cse188)))) (not (bvule .cse195 (select |c_#length| .cse190)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse195))))) (not (bvule .cse184 (select |c_#length| .cse193))) (not (= .cse193 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse197 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse196 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse202 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (not (bvule .cse196 .cse197)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse203 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse198 (select (select .cse203 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse197 (select |c_#length| .cse198))) (= .cse198 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse200 (store .cse203 .cse198 (store (select .cse203 .cse198) .cse196 v_ArrVal_2288)))) (let ((.cse201 (select (select .cse200 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse199 (select |c_#length| (select (select (store .cse200 .cse201 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse199)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse199)))) (not (bvule .cse202 (select |c_#length| .cse201))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse202))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse205 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse204 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse204 .cse205)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse213 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse206 (select (select .cse213 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse205 (select |c_#length| .cse206))) (not (= .cse206 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse207 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse214 (select .cse213 .cse206))) (let ((.cse211 (store .cse213 .cse206 (store .cse214 .cse204 v_ArrVal_2288)))) (let ((.cse208 (select (select .cse211 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse207 (select |c_#length| .cse208))) (= .cse208 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse209 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse210 (select |c_#length| (select (select (let ((.cse212 (store .cse213 .cse206 (store .cse214 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse212 (select (select .cse212 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse209 .cse210) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse210) (bvule .cse209 (select |c_#length| (select (select (store .cse211 .cse208 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse210))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse207)))))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse216 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse215 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse218 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (not (bvule .cse215 .cse216)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse221 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse217 (select (select .cse221 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse216 (select |c_#length| .cse217))) (= .cse217 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse220 (store .cse221 .cse217 (store (select .cse221 .cse217) .cse215 v_ArrVal_2288)))) (let ((.cse219 (select (select .cse220 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse218 (select |c_#length| .cse219))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse220 .cse219 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse218))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse223 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse222 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse222 .cse223)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse229 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse224 (select (select .cse229 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse223 (select |c_#length| .cse224))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse225 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse228 (store .cse229 .cse224 (store (select .cse229 .cse224) .cse222 v_ArrVal_2288)))) (let ((.cse226 (select (select .cse228 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse225 (select |c_#length| .cse226))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse227 (select |c_#length| (select (select (store .cse228 .cse226 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse227) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse227))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse225))))) (not (= .cse224 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse235 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse236 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse233 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse234 (select (select .cse233 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse230 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse232 (store .cse233 .cse234 (store (select .cse233 .cse234) .cse235 v_ArrVal_2288)))) (let ((.cse231 (select (select .cse232 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse230 (select |c_#length| .cse231))) (not (= .cse231 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse232 .cse231 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse230))))) (not (bvule .cse236 (select |c_#length| .cse234))) (not (= .cse234 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule .cse235 .cse236))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse237 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse238 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse237 .cse238)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse245 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse246 (select (select .cse245 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse240 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse247 (select .cse245 .cse246))) (let ((.cse244 (store .cse245 .cse246 (store .cse247 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288))) (.cse243 (store .cse245 .cse246 (store .cse247 .cse237 v_ArrVal_2288)))) (let ((.cse241 (select (select .cse243 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse239 (select (select .cse244 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse239) (not (bvule .cse240 (select |c_#length| .cse241))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse242 (select |c_#length| (select (select (store .cse244 .cse239 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse242) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse242) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse243 .cse241 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse240))))) (not (bvule .cse238 (select |c_#length| .cse246))) (not (= .cse246 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse249 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse248 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse248 .cse249)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse259 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse250 (select (select .cse259 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse249 (select |c_#length| .cse250))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse251 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse260 (select .cse259 .cse250))) (let ((.cse257 (store .cse259 .cse250 (store .cse260 .cse248 v_ArrVal_2288)))) (let ((.cse252 (select (select .cse257 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse251 (select |c_#length| .cse252))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse254 (select |c_#length| (select (select (let ((.cse258 (store .cse259 .cse250 (store .cse260 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse258 (select (select .cse258 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse253 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse256 (select |c_#length| (select (select (store .cse257 .cse252 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse253 .cse254) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse255 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse255 .cse256) (bvule .cse255 .cse254)))) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse254) (bvule .cse253 .cse256))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse251))))) (not (= .cse250 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse262 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse261 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse261 .cse262)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse270 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse263 (select (select .cse270 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse262 (select |c_#length| .cse263))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse265 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse271 (select .cse270 .cse263))) (let ((.cse269 (store .cse270 .cse263 (store .cse271 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288))) (.cse267 (store .cse270 .cse263 (store .cse271 .cse261 v_ArrVal_2288)))) (let ((.cse266 (select (select .cse267 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse264 (select (select .cse269 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse264) (not (bvule .cse265 (select |c_#length| .cse266))) (not (= .cse266 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse268 (select |c_#length| (select (select (store .cse269 .cse264 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse267 .cse266 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse268) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse268))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse265))))) (not (= .cse263 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse281 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse272 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse279 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse273 (select (select .cse279 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse272 (select |c_#length| .cse273))) (not (= .cse273 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse278 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse280 (select .cse279 .cse273))) (let ((.cse276 (store .cse279 .cse273 (store .cse280 .cse281 v_ArrVal_2288))) (.cse275 (store .cse279 .cse273 (store .cse280 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse274 (select (select .cse275 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse277 (select (select .cse276 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse274) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse275 .cse274 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse276 .cse277 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))) (not (bvule .cse278 (select |c_#length| .cse277))) (= .cse277 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse278))))))))) (not (bvule .cse281 .cse272))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse282 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse283 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse282 .cse283)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse288 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse289 (select (select .cse288 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse285 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse290 (select .cse288 .cse289))) (let ((.cse287 (store .cse288 .cse289 (store .cse290 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse286 (select (select (store .cse288 .cse289 (store .cse290 .cse282 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse284 (select (select .cse287 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse284) (not (bvule .cse285 (select |c_#length| .cse286))) (= .cse286 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse287 .cse284 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse285))))) (not (bvule .cse283 (select |c_#length| .cse289))) (not (= .cse289 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse291 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse292 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse291 .cse292)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse297 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse298 (select (select .cse297 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse293 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse296 (store .cse297 .cse298 (store (select .cse297 .cse298) .cse291 v_ArrVal_2288)))) (let ((.cse294 (select (select .cse296 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse293 (select |c_#length| .cse294))) (= .cse294 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse295 (select |c_#length| (select (select (store .cse296 .cse294 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse295) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse295)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse293))))) (not (bvule .cse292 (select |c_#length| .cse298))) (not (= .cse298 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))))) .cse299) (or (and (forall ((v_arrayElimCell_132 (_ BitVec 64))) (let ((.cse300 (bvadd (_ bv10 64) v_arrayElimCell_132)) (.cse301 (bvadd v_arrayElimCell_132 (_ bv11 64)))) (or (not (bvule .cse300 .cse301)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse302 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse303 (select (select .cse302 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_131 (_ BitVec 64))) (or (bvule (bvadd v_arrayElimCell_131 .cse11) (bvadd v_arrayElimCell_131 .cse11 (_ bv1 64))) (forall ((v_ArrVal_2288 (_ BitVec 64))) (not (bvule (bvadd .cse2 v_arrayElimCell_131 (_ bv1 64)) (select |c_#length| (select (select (store .cse302 .cse303 (store (select .cse302 .cse303) .cse300 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))) (not (bvule .cse301 (select |c_#length| .cse303))) (not (= .cse303 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_132 (_ BitVec 64))) (or (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse304 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse305 (select (select .cse304 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_132 (_ bv1 64)) (select |c_#length| (select (select (store .cse304 .cse305 (store (select .cse304 .cse305) (bvadd (_ bv10 64) v_arrayElimCell_132) v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (= .cse305 |c_ULTIMATE.start_main_~argv~0#1.base|))))) (bvule (bvadd v_arrayElimCell_132 .cse11) (bvadd v_arrayElimCell_132 .cse11 (_ bv1 64))))) (forall ((v_arrayElimCell_132 (_ BitVec 64))) (let ((.cse307 (bvadd v_arrayElimCell_132 (_ bv11 64))) (.cse306 (bvadd (_ bv10 64) v_arrayElimCell_132))) (or (not (bvule .cse306 .cse307)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse311 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse308 (select (select .cse311 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse307 (select |c_#length| .cse308))) (forall ((v_arrayElimCell_131 (_ BitVec 64))) (let ((.cse309 (bvadd .cse2 v_arrayElimCell_131 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_131) .cse309)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse310 (select (select (store .cse311 .cse308 (store (select .cse311 .cse308) .cse306 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse309 (select |c_#length| .cse310))) (not (= .cse310 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))) (not (= .cse308 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))))) .cse299) (or .cse15 (and (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse313 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse312 (bvadd (_ bv10 64) v_arrayElimCell_134))) (or (not (bvule .cse312 .cse313)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse320 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse314 (select (select .cse320 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse313 (select |c_#length| .cse314))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse319 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse321 (select .cse320 .cse314))) (let ((.cse315 (store .cse320 .cse314 (store .cse321 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288))) (.cse317 (store .cse320 .cse314 (store .cse321 .cse312 v_ArrVal_2288)))) (let ((.cse318 (select (select .cse317 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse316 (select (select .cse315 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse315 .cse316 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse317 .cse318 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))) (not (bvule .cse319 (select |c_#length| .cse318))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse318)) (= .cse316 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse319))))) (not (= .cse314 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse324 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64))) (.cse322 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse323 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse322 .cse323)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse324)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse328 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse329 (select (select .cse328 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse330 (select .cse328 .cse329))) (let ((.cse331 (store .cse328 .cse329 (store .cse330 .cse322 v_ArrVal_2288)))) (let ((.cse325 (select (select .cse331 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse324 (select |c_#length| .cse325))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse326 (select |c_#length| (select (select (store .cse331 .cse325 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse326) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse326) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse327 (store .cse328 .cse329 (store .cse330 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse327 (select (select .cse327 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))))) (= .cse329 |c_ULTIMATE.start_main_~argv~0#1.base|) (not (bvule .cse323 (select |c_#length| .cse329)))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse332 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse333 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse332 .cse333)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse338 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse339 (select (select .cse338 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse334 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse337 (store .cse338 .cse339 (store (select .cse338 .cse339) .cse332 v_ArrVal_2288)))) (let ((.cse335 (select (select .cse337 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse334 (select |c_#length| .cse335))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse335) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse336 (select |c_#length| (select (select (store .cse337 .cse335 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse336) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse336)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse334))))) (not (bvule .cse333 (select |c_#length| .cse339))) (not (= .cse339 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse340 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse341 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse340 .cse341)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse349 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse350 (select (select .cse349 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse348 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse351 (select .cse349 .cse350))) (let ((.cse344 (store .cse349 .cse350 (store .cse351 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288))) (.cse346 (store .cse349 .cse350 (store .cse351 .cse340 v_ArrVal_2288)))) (let ((.cse347 (select (select .cse346 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse345 (select (select .cse344 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse342 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse343 (select |c_#length| (select (select (store .cse346 .cse347 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse342 .cse343) (bvule .cse342 (select |c_#length| (select (select (store .cse344 .cse345 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse343)))) (not (bvule .cse348 (select |c_#length| .cse347))) (= .cse345 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse348))))) (not (bvule .cse341 (select |c_#length| .cse350))) (not (= .cse350 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse352 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse353 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse352 .cse353)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse358 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse359 (select (select .cse358 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse354 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse360 (select .cse358 .cse359))) (let ((.cse361 (store .cse358 .cse359 (store .cse360 .cse352 v_ArrVal_2288)))) (let ((.cse355 (select (select .cse361 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse354 (select |c_#length| .cse355))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse355) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse356 (select |c_#length| (select (select (store .cse361 .cse355 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse356) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse356) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse357 (store .cse358 .cse359 (store .cse360 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse357 (select (select .cse357 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse354))))) (not (bvule .cse353 (select |c_#length| .cse359))) (not (= .cse359 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse362 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse363 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse362 .cse363)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse371 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse372 (select (select .cse371 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse364 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse373 (select .cse371 .cse372))) (let ((.cse374 (store .cse371 .cse372 (store .cse373 .cse362 v_ArrVal_2288)))) (let ((.cse365 (select (select .cse374 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse364 (select |c_#length| .cse365))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse367 (select |c_#length| (select (select (store .cse374 .cse365 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse366 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse369 (select |c_#length| (select (select (let ((.cse370 (store .cse371 .cse372 (store .cse373 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse370 (select (select .cse370 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse366 .cse367) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse368 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse368 .cse369) (bvule .cse368 .cse367)))) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse367) (bvule .cse366 .cse369))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse364))))) (not (bvule .cse363 (select |c_#length| .cse372))) (not (= .cse372 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse375 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse376 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse375 .cse376)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse383 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse384 (select (select .cse383 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse377 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse385 (select .cse383 .cse384))) (let ((.cse382 (store .cse383 .cse384 (store .cse385 .cse375 v_ArrVal_2288))) (.cse380 (store .cse383 .cse384 (store .cse385 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (let ((.cse379 (select (select .cse380 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse378 (select (select .cse382 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse377 (select |c_#length| .cse378))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse378) (not (= .cse379 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse381 (select |c_#length| (select (select (store .cse382 .cse378 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse380 .cse379 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse381) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse381))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse377))))) (not (bvule .cse376 (select |c_#length| .cse384))) (not (= .cse384 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse387 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse386 (bvadd (_ bv10 64) v_arrayElimCell_134))) (or (not (bvule .cse386 .cse387)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse392 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse388 (select (select .cse392 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse387 (select |c_#length| .cse388))) (not (= .cse388 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse389 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse391 (store .cse392 .cse388 (store (select .cse392 .cse388) .cse386 v_ArrVal_2288)))) (let ((.cse390 (select (select .cse391 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse389 (select |c_#length| .cse390))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse390) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse391 .cse390 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse389)))))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse395 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64))) (.cse393 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse394 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse393 .cse394)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse395)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse399 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse396 (select (select .cse399 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse396 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse398 (store .cse399 .cse396 (store (select .cse399 .cse396) .cse393 v_ArrVal_2288)))) (let ((.cse397 (select (select .cse398 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse395 (select |c_#length| .cse397))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse398 .cse397 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))) (not (bvule .cse394 (select |c_#length| .cse396)))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse401 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse400 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse402 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64)))) (or (not (bvule .cse400 .cse401)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2288 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_137 (_ BitVec 64)) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse407 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse405 (select (select .cse407 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse406 (store .cse407 .cse405 (store (select .cse407 .cse405) .cse400 v_ArrVal_2288)))) (let ((.cse403 (select (select .cse406 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse404 (select |c_#length| (select (select (store .cse406 .cse403 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (not (bvule .cse402 (select |c_#length| .cse403))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse404) (= .cse405 |c_ULTIMATE.start_main_~argv~0#1.base|) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse404) (not (bvule .cse401 (select |c_#length| .cse405))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse404)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse402))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse408 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse409 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse408 .cse409)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse416 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse417 (select (select .cse416 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse410 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse418 (select .cse416 .cse417))) (let ((.cse414 (store .cse416 .cse417 (store .cse418 .cse408 v_ArrVal_2288)))) (let ((.cse411 (select (select .cse414 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse410 (select |c_#length| .cse411))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse411)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse413 (select |c_#length| (select (select (let ((.cse415 (store .cse416 .cse417 (store .cse418 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse415 (select (select .cse415 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse412 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse412 .cse413) (bvule .cse412 (select |c_#length| (select (select (store .cse414 .cse411 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse413))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse410))))) (not (bvule .cse409 (select |c_#length| .cse417))) (not (= .cse417 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse419 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse420 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse419 .cse420)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse425 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse426 (select (select .cse425 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse424 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse422 (store .cse425 .cse426 (store (select .cse425 .cse426) .cse419 v_ArrVal_2288)))) (let ((.cse423 (select (select .cse422 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse421 (select |c_#length| (select (select (store .cse422 .cse423 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse421) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse421)))) (not (bvule .cse424 (select |c_#length| .cse423))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse424))))) (not (bvule .cse420 (select |c_#length| .cse426))) (not (= .cse426 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse436 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse437 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse435 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64)))) (or (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse431 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse427 (select (select .cse431 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse427 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse432 (select .cse431 .cse427))) (let ((.cse433 (store .cse431 .cse427 (store .cse432 .cse436 v_ArrVal_2288)))) (let ((.cse434 (select (select .cse433 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse428 (select |c_#length| (select (select (store .cse433 .cse434 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse429 (select |c_#length| (select (select (let ((.cse430 (store .cse431 .cse427 (store .cse432 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse430 (select (select .cse430 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse428) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse428) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse429)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse429)))) (not (bvule .cse435 (select |c_#length| .cse434)))))))) (not (bvule .cse437 (select |c_#length| .cse427))))))) (not (bvule .cse436 .cse437)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse435))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse438 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse439 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse438 .cse439)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse444 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse445 (select (select .cse444 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64)) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse443 (store .cse444 .cse445 (store (select .cse444 .cse445) .cse438 v_ArrVal_2288)))) (let ((.cse441 (select (select .cse443 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse440 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64))) (.cse442 (select |c_#length| (select (select (store .cse443 .cse441 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (not (bvule .cse440 (select |c_#length| .cse441))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse442) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse442) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse440)) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse442)))))) (not (bvule .cse439 (select |c_#length| .cse445))) (not (= .cse445 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse446 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse447 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse446 .cse447)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse452 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse453 (select (select .cse452 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse448 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse448)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse454 (select .cse452 .cse453))) (let ((.cse449 (store .cse452 .cse453 (store .cse454 .cse446 v_ArrVal_2288)))) (let ((.cse450 (select (select .cse449 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse449 .cse450 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse451 (store .cse452 .cse453 (store .cse454 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse451 (select (select .cse451 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))) (not (bvule .cse448 (select |c_#length| .cse450))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse450))))))))) (not (bvule .cse447 (select |c_#length| .cse453))) (not (= .cse453 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse455 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse456 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse455 .cse456)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse464 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse465 (select (select .cse464 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse457 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse457)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse466 (select .cse464 .cse465))) (let ((.cse463 (store .cse464 .cse465 (store .cse466 .cse455 v_ArrVal_2288))) (.cse461 (store .cse464 .cse465 (store .cse466 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (let ((.cse459 (select (select .cse461 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse458 (select (select .cse463 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse457 (select |c_#length| .cse458))) (not (= .cse459 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse460 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64))) (.cse462 (select |c_#length| (select (select (store .cse463 .cse458 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse460 (select |c_#length| (select (select (store .cse461 .cse459 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse462) (bvule .cse460 .cse462)))))))))))) (not (bvule .cse456 (select |c_#length| .cse465))) (not (= .cse465 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse467 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse468 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse467 .cse468)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse474 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse475 (select (select .cse474 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse479 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse476 (select .cse474 .cse475))) (let ((.cse477 (store .cse474 .cse475 (store .cse476 .cse467 v_ArrVal_2288)))) (let ((.cse478 (select (select .cse477 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse470 (select |c_#length| (select (select (store .cse477 .cse478 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse469 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse472 (select |c_#length| (select (select (let ((.cse473 (store .cse474 .cse475 (store .cse476 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse473 (select (select .cse473 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse469 .cse470) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse471 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse471 .cse472) (bvule .cse471 .cse470)))) (bvule .cse469 .cse472)))) (not (bvule .cse479 (select |c_#length| .cse478)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse479))))) (not (bvule .cse468 (select |c_#length| .cse475))) (not (= .cse475 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse482 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64))) (.cse480 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse481 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse480 .cse481)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse482)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse487 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse483 (select (select .cse487 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse483 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse486 (store .cse487 .cse483 (store (select .cse487 .cse483) .cse480 v_ArrVal_2288)))) (let ((.cse484 (select (select .cse486 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse482 (select |c_#length| .cse484))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse485 (select |c_#length| (select (select (store .cse486 .cse484 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse485) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse485)))))))) (not (bvule .cse481 (select |c_#length| .cse483)))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse496 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse489 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse490 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64)))) (or (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse494 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse488 (select (select .cse494 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse488 |c_ULTIMATE.start_main_~argv~0#1.base|) (not (bvule .cse489 (select |c_#length| .cse488))) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse495 (select .cse494 .cse488))) (let ((.cse492 (store .cse494 .cse488 (store .cse495 .cse496 v_ArrVal_2288)))) (let ((.cse491 (select (select .cse492 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse490 (select |c_#length| .cse491))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse492 .cse491 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse493 (store .cse494 .cse488 (store .cse495 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse493 (select (select .cse493 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))))) (not (bvule .cse496 .cse489)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse490))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse498 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse497 (bvadd (_ bv10 64) v_arrayElimCell_134))) (or (not (bvule .cse497 .cse498)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse507 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse499 (select (select .cse507 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse498 (select |c_#length| .cse499))) (not (= .cse499 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse500 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse508 (select .cse507 .cse499))) (let ((.cse506 (store .cse507 .cse499 (store .cse508 .cse497 v_ArrVal_2288))) (.cse505 (store .cse507 .cse499 (store .cse508 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (let ((.cse502 (select (select .cse505 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse501 (select (select .cse506 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse500 (select |c_#length| .cse501))) (= .cse502 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse503 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse504 (select |c_#length| (select (select (store .cse506 .cse501 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse503 .cse504) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse504) (bvule .cse503 (select |c_#length| (select (select (store .cse505 .cse502 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse504))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse500)))))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse510 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse511 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64))) (.cse509 (bvadd (_ bv10 64) v_arrayElimCell_134))) (or (not (bvule .cse509 .cse510)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse511)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse516 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse512 (select (select .cse516 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse512 |c_ULTIMATE.start_main_~argv~0#1.base|) (not (bvule .cse510 (select |c_#length| .cse512))) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse515 (store .cse516 .cse512 (store (select .cse516 .cse512) .cse509 v_ArrVal_2288)))) (let ((.cse513 (select (select .cse515 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse511 (select |c_#length| .cse513))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse514 (select |c_#length| (select (select (store .cse515 .cse513 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse514) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse514))))))))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse518 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse517 (bvadd (_ bv10 64) v_arrayElimCell_134))) (or (not (bvule .cse517 .cse518)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse525 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse519 (select (select .cse525 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse518 (select |c_#length| .cse519))) (not (= .cse519 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse520 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse526 (select .cse525 .cse519))) (let ((.cse523 (store .cse525 .cse519 (store .cse526 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288))) (.cse522 (store .cse525 .cse519 (store .cse526 .cse517 v_ArrVal_2288)))) (let ((.cse521 (select (select .cse522 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse524 (select (select .cse523 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse520 (select |c_#length| .cse521))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse521) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse522 .cse521 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse523 .cse524 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))) (= .cse524 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse520)))))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse528 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse527 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse530 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64)))) (or (not (bvule .cse527 .cse528)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse535 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse529 (select (select .cse535 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse529 |c_ULTIMATE.start_main_~argv~0#1.base|) (not (bvule .cse528 (select |c_#length| .cse529))) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse536 (select .cse535 .cse529))) (let ((.cse532 (store .cse535 .cse529 (store .cse536 .cse527 v_ArrVal_2288)))) (let ((.cse531 (select (select .cse532 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse530 (select |c_#length| .cse531))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse533 (select |c_#length| (select (select (let ((.cse534 (store .cse535 .cse529 (store .cse536 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse534 (select (select .cse534 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse532 .cse531 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse533)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse533))))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse530))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse537 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse538 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse537 .cse538)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse542 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse543 (select (select .cse542 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse539 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse539)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse541 (store .cse542 .cse543 (store (select .cse542 .cse543) .cse537 v_ArrVal_2288)))) (let ((.cse540 (select (select .cse541 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse539 (select |c_#length| .cse540))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse541 .cse540 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse540))))))))) (not (bvule .cse538 (select |c_#length| .cse543))) (not (= .cse543 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse553 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse554 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse547 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse548 (select (select .cse547 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse552 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse549 (select .cse547 .cse548))) (let ((.cse550 (store .cse547 .cse548 (store .cse549 .cse553 v_ArrVal_2288)))) (let ((.cse551 (select (select .cse550 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse544 (select |c_#length| (select (select (store .cse550 .cse551 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse545 (select |c_#length| (select (select (let ((.cse546 (store .cse547 .cse548 (store .cse549 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse546 (select (select .cse546 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse544) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse544) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse545)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse545)))) (not (bvule .cse552 (select |c_#length| .cse551))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse551)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse552))))) (not (bvule .cse554 (select |c_#length| .cse548))) (not (= .cse548 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule .cse553 .cse554))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse555 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse556 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse555 .cse556)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse564 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse565 (select (select .cse564 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64)) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse566 (select .cse564 .cse565))) (let ((.cse563 (store .cse564 .cse565 (store .cse566 .cse555 v_ArrVal_2288)))) (let ((.cse558 (select (select .cse563 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse560 (store .cse564 .cse565 (store .cse566 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (let ((.cse561 (select (select .cse560 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse557 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64))) (.cse559 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64))) (.cse562 (select |c_#length| (select (select (store .cse563 .cse558 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (not (bvule .cse557 (select |c_#length| .cse558))) (bvule .cse559 (select |c_#length| (select (select (store .cse560 .cse561 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse562) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse562) (not (= .cse561 |c_ULTIMATE.start_main_~argv~0#1.base|)) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse557)) (bvule .cse559 .cse562))))))) (not (bvule .cse556 (select |c_#length| .cse565))) (not (= .cse565 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))))))))) is different from false [2023-12-02 15:50:56,687 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse15 (= |c_ULTIMATE.start_main_~argv~0#1.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|))) (let ((.cse299 (not .cse15)) (.cse11 ((_ sign_extend 32) (_ bv1 32))) (.cse2 ((_ sign_extend 32) (_ bv0 32))) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (or (and (forall ((v_arrayElimCell_130 (_ BitVec 64))) (let ((.cse0 (bvadd (_ bv10 64) v_arrayElimCell_130)) (.cse1 (bvadd v_arrayElimCell_130 (_ bv11 64)))) (or (not (bvule .cse0 .cse1)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_131 (_ BitVec 64))) (let ((.cse3 (bvadd .cse2 v_arrayElimCell_131 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_131) .cse3)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse4 (select (select (store .cse5 .cse6 (store (select .cse5 .cse6) .cse0 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse3 (select |c_#length| .cse4))) (not (= .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))) (not (= .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|)) (not (bvule .cse1 (select |c_#length| .cse6)))))))))) (forall ((v_arrayElimCell_130 (_ BitVec 64))) (let ((.cse8 (bvadd (_ bv10 64) v_arrayElimCell_130)) (.cse9 (bvadd v_arrayElimCell_130 (_ bv11 64)))) (or (not (bvule .cse8 .cse9)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (= .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_131 (_ BitVec 64))) (or (bvule (bvadd v_arrayElimCell_131 .cse11) (bvadd v_arrayElimCell_131 .cse11 (_ bv1 64))) (forall ((v_ArrVal_2288 (_ BitVec 64))) (not (bvule (bvadd .cse2 v_arrayElimCell_131 (_ bv1 64)) (select |c_#length| (select (select (store .cse12 .cse10 (store (select .cse12 .cse10) .cse8 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))) (not (bvule .cse9 (select |c_#length| .cse10)))))))))) (forall ((v_arrayElimCell_130 (_ BitVec 64))) (or (bvule (bvadd v_arrayElimCell_130 .cse11) (bvadd v_arrayElimCell_130 .cse11 (_ bv1 64))) (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_130 (_ bv1 64)) (select |c_#length| (select (select (store .cse13 .cse14 (store (select .cse13 .cse14) (bvadd (_ bv10 64) v_arrayElimCell_130) v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (= .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))) .cse15) (or (and (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse17 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse16 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse16 .cse17)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse18 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse17 (select |c_#length| .cse18))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse19 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse22 (store .cse23 .cse18 (store (select .cse23 .cse18) .cse16 v_ArrVal_2288)))) (let ((.cse20 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse19 (select |c_#length| .cse20))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse21 (select |c_#length| (select (select (store .cse22 .cse20 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse21) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse21)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse21)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse19))))) (not (= .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse24 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse25 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse24 .cse25)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse28 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse32 (select .cse30 .cse31))) (let ((.cse26 (store .cse30 .cse31 (store .cse32 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse29 (select (select (store .cse30 .cse31 (store .cse32 .cse24 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse26 .cse27 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (not (bvule .cse28 (select |c_#length| .cse29))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse27)) (not (= .cse29 |c_ULTIMATE.start_main_~argv~0#1.base|))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse28))))) (not (bvule .cse25 (select |c_#length| .cse31))) (not (= .cse31 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse34 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse33 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse33 .cse34)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse35 (select (select .cse41 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse34 (select |c_#length| .cse35))) (not (= .cse35 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse37 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse42 (select .cse41 .cse35))) (let ((.cse40 (store .cse41 .cse35 (store .cse42 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse38 (select (select (store .cse41 .cse35 (store .cse42 .cse33 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse36 (select (select .cse40 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse36) (not (bvule .cse37 (select |c_#length| .cse38))) (= .cse38 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse39 (select |c_#length| (select (select (store .cse40 .cse36 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse39) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse39))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse37)))))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse45 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64))) (.cse43 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse44 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse43 .cse44)) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse45)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse50 (select (select .cse49 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse48 (store .cse49 .cse50 (store (select .cse49 .cse50) .cse43 v_ArrVal_2288)))) (let ((.cse46 (select (select .cse48 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse45 (select |c_#length| .cse46))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse47 (select |c_#length| (select (select (store .cse48 .cse46 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse47) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse47)))))))) (not (bvule .cse44 (select |c_#length| .cse50))) (= .cse50 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse52 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse51 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse59 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (not (bvule .cse51 .cse52)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse53 (select (select .cse55 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse52 (select |c_#length| .cse53))) (= .cse53 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse56 (select .cse55 .cse53))) (let ((.cse57 (store .cse55 .cse53 (store .cse56 .cse51 v_ArrVal_2288)))) (let ((.cse58 (select (select .cse57 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse54 (store .cse55 .cse53 (store .cse56 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse54 (select (select .cse54 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse57 .cse58 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))) (not (bvule .cse59 (select |c_#length| .cse58)))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse59))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse61 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse62 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64))) (.cse60 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse60 .cse61)) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse62)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse63 (select (select .cse69 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse61 (select |c_#length| .cse63))) (= .cse63 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse70 (select .cse69 .cse63))) (let ((.cse66 (store .cse69 .cse63 (store .cse70 .cse60 v_ArrVal_2288)))) (let ((.cse67 (select (select .cse66 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse64 (select |c_#length| (select (select (let ((.cse68 (store .cse69 .cse63 (store .cse70 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse68 (select (select .cse68 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse65 (select |c_#length| (select (select (store .cse66 .cse67 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse64) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse64) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse65)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse65)))) (not (bvule .cse62 (select |c_#length| .cse67))))))))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse72 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse71 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse71 .cse72)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse79 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse73 (select (select .cse79 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse72 (select |c_#length| .cse73))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse78 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse80 (select .cse79 .cse73))) (let ((.cse76 (store .cse79 .cse73 (store .cse80 .cse71 v_ArrVal_2288))) (.cse74 (store .cse79 .cse73 (store .cse80 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse75 (select (select .cse74 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse77 (select (select .cse76 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse74 .cse75 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse76 .cse77 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse75) (not (bvule .cse78 (select |c_#length| .cse77)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse78))))) (not (= .cse73 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse82 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse81 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse81 .cse82)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse91 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse83 (select (select .cse91 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse82 (select |c_#length| .cse83))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse90 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse92 (select .cse91 .cse83))) (let ((.cse86 (store .cse91 .cse83 (store .cse92 .cse81 v_ArrVal_2288))) (.cse88 (store .cse91 .cse83 (store .cse92 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse89 (select (select .cse88 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse87 (select (select .cse86 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse84 (select |c_#length| (select (select (store .cse88 .cse89 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse85 (select |c_#length| (select (select (store .cse86 .cse87 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse84) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse84) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse85)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse85)))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse89) (not (bvule .cse90 (select |c_#length| .cse87)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse90))))) (not (= .cse83 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse102 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse93 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse100 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse94 (select (select .cse100 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse93 (select |c_#length| .cse94))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse99 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse101 (select .cse100 .cse94))) (let ((.cse95 (store .cse100 .cse94 (store .cse101 .cse102 v_ArrVal_2288))) (.cse97 (store .cse100 .cse94 (store .cse101 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse98 (select (select .cse97 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse96 (select (select .cse95 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse95 .cse96 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse97 .cse98 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))) (not (bvule .cse99 (select |c_#length| .cse96))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse98)) (= .cse96 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse99))))) (not (= .cse94 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule .cse102 .cse93))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse113 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse103 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse110 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse104 (select (select .cse110 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse103 (select |c_#length| .cse104))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse112 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse111 (select .cse110 .cse104))) (let ((.cse107 (store .cse110 .cse104 (store .cse111 .cse113 v_ArrVal_2288)))) (let ((.cse108 (select (select .cse107 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse105 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse106 (select |c_#length| (select (select (let ((.cse109 (store .cse110 .cse104 (store .cse111 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse109 (select (select .cse109 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse105 .cse106) (bvule .cse105 (select |c_#length| (select (select (store .cse107 .cse108 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse106)))) (not (bvule .cse112 (select |c_#length| .cse108))) (= .cse108 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse112))))) (not (= .cse104 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule .cse113 .cse103))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse115 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse114 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse117 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (not (bvule .cse114 .cse115)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse120 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse116 (select (select .cse120 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse115 (select |c_#length| .cse116))) (= .cse116 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse121 (select .cse120 .cse116))) (let ((.cse123 (store .cse120 .cse116 (store .cse121 .cse114 v_ArrVal_2288)))) (let ((.cse118 (select (select .cse123 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse117 (select |c_#length| .cse118))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse122 (select |c_#length| (select (select (store .cse123 .cse118 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse119 (store .cse120 .cse116 (store .cse121 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse119 (select (select .cse119 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse122)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse122))))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse117))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse130 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse124 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse129 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse125 (select (select .cse129 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse124 (select |c_#length| .cse125))) (not (= .cse125 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse126 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse128 (store .cse129 .cse125 (store (select .cse129 .cse125) .cse130 v_ArrVal_2288)))) (let ((.cse127 (select (select .cse128 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse126 (select |c_#length| .cse127))) (= .cse127 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse128 .cse127 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse126))))))))) (not (bvule .cse130 .cse124))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse131 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse132 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse133 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (not (bvule .cse131 .cse132)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse137 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse138 (select (select .cse137 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse136 (store .cse137 .cse138 (store (select .cse137 .cse138) .cse131 v_ArrVal_2288)))) (let ((.cse134 (select (select .cse136 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse133 (select |c_#length| .cse134))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse135 (select |c_#length| (select (select (store .cse136 .cse134 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse135) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse135)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse135)))))))) (not (bvule .cse132 (select |c_#length| .cse138))) (= .cse138 |c_ULTIMATE.start_main_~argv~0#1.base|))))) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse133))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse140 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse139 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse139 .cse140)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse149 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse141 (select (select .cse149 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse140 (select |c_#length| .cse141))) (not (= .cse141 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse142 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse150 (select .cse149 .cse141))) (let ((.cse148 (store .cse149 .cse141 (store .cse150 .cse139 v_ArrVal_2288))) (.cse147 (store .cse149 .cse141 (store .cse150 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse144 (select (select .cse147 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse143 (select (select .cse148 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse142 (select |c_#length| .cse143))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse144)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse146 (select |c_#length| (select (select (store .cse148 .cse143 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse145 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse145 .cse146) (bvule .cse145 (select |c_#length| (select (select (store .cse147 .cse144 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse146))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse142)))))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse161 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse151 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse159 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse152 (select (select .cse159 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse151 (select |c_#length| .cse152))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse153 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse153)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse160 (select .cse159 .cse152))) (let ((.cse156 (store .cse159 .cse152 (store .cse160 .cse161 v_ArrVal_2288)))) (let ((.cse154 (select (select .cse156 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse153 (select |c_#length| .cse154))) (not (= .cse154 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse155 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64))) (.cse157 (select |c_#length| (select (select (let ((.cse158 (store .cse159 .cse152 (store .cse160 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse158 (select (select .cse158 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse155 (select |c_#length| (select (select (store .cse156 .cse154 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse157) (bvule .cse155 .cse157)))))))))))) (not (= .cse152 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule .cse161 .cse151))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse171 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse162 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse164 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse169 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse163 (select (select .cse169 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse162 (select |c_#length| .cse163))) (= .cse163 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse170 (select .cse169 .cse163))) (let ((.cse167 (store .cse169 .cse163 (store .cse170 .cse171 v_ArrVal_2288)))) (let ((.cse165 (select (select .cse167 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse164 (select |c_#length| .cse165))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse166 (select |c_#length| (select (select (let ((.cse168 (store .cse169 .cse163 (store .cse170 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse168 (select (select .cse168 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse166) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse166) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse167 .cse165 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))))))))) (not (bvule .cse171 .cse162)) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse164))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse173 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse172 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse172 .cse173)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse181 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse174 (select (select .cse181 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse173 (select |c_#length| .cse174))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse175 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse182 (select .cse181 .cse174))) (let ((.cse178 (store .cse181 .cse174 (store .cse182 .cse172 v_ArrVal_2288)))) (let ((.cse176 (select (select .cse178 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse175 (select |c_#length| .cse176))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse177 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64))) (.cse179 (select |c_#length| (select (select (let ((.cse180 (store .cse181 .cse174 (store .cse182 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse180 (select (select .cse180 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse177 (select |c_#length| (select (select (store .cse178 .cse176 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse179) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse179) (bvule .cse177 .cse179)))) (not (= .cse176 |c_ULTIMATE.start_main_~argv~0#1.base|))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse175))))) (not (= .cse174 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse183 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse184 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse183 .cse184)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse192 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse193 (select (select .cse192 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse195 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse194 (select .cse192 .cse193))) (let ((.cse189 (store .cse192 .cse193 (store .cse194 .cse183 v_ArrVal_2288)))) (let ((.cse190 (select (select .cse189 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse186 (select |c_#length| (select (select (let ((.cse191 (store .cse192 .cse193 (store .cse194 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse191 (select (select .cse191 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse185 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse188 (select |c_#length| (select (select (store .cse189 .cse190 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse185 .cse186) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse187 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse187 .cse188) (bvule .cse187 .cse186)))) (bvule .cse185 .cse188)))) (not (bvule .cse195 (select |c_#length| .cse190)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse195))))) (not (bvule .cse184 (select |c_#length| .cse193))) (not (= .cse193 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse197 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse196 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse202 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (not (bvule .cse196 .cse197)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse203 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse198 (select (select .cse203 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse197 (select |c_#length| .cse198))) (= .cse198 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse200 (store .cse203 .cse198 (store (select .cse203 .cse198) .cse196 v_ArrVal_2288)))) (let ((.cse201 (select (select .cse200 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse199 (select |c_#length| (select (select (store .cse200 .cse201 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse199)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse199)))) (not (bvule .cse202 (select |c_#length| .cse201))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse202))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse205 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse204 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse204 .cse205)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse213 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse206 (select (select .cse213 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse205 (select |c_#length| .cse206))) (not (= .cse206 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse207 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse214 (select .cse213 .cse206))) (let ((.cse211 (store .cse213 .cse206 (store .cse214 .cse204 v_ArrVal_2288)))) (let ((.cse208 (select (select .cse211 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse207 (select |c_#length| .cse208))) (= .cse208 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse209 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse210 (select |c_#length| (select (select (let ((.cse212 (store .cse213 .cse206 (store .cse214 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse212 (select (select .cse212 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse209 .cse210) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse210) (bvule .cse209 (select |c_#length| (select (select (store .cse211 .cse208 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse210))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse207)))))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse216 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse215 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse218 (bvadd .cse2 v_arrayElimCell_135 (_ bv1 64)))) (or (not (bvule .cse215 .cse216)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse221 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse217 (select (select .cse221 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse216 (select |c_#length| .cse217))) (= .cse217 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse220 (store .cse221 .cse217 (store (select .cse221 .cse217) .cse215 v_ArrVal_2288)))) (let ((.cse219 (select (select .cse220 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse218 (select |c_#length| .cse219))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse220 .cse219 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_135) .cse218))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse223 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse222 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse222 .cse223)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse229 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse224 (select (select .cse229 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse223 (select |c_#length| .cse224))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse225 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse228 (store .cse229 .cse224 (store (select .cse229 .cse224) .cse222 v_ArrVal_2288)))) (let ((.cse226 (select (select .cse228 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse225 (select |c_#length| .cse226))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse227 (select |c_#length| (select (select (store .cse228 .cse226 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse227) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse227))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse225))))) (not (= .cse224 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse235 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse236 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse233 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse234 (select (select .cse233 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse230 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse232 (store .cse233 .cse234 (store (select .cse233 .cse234) .cse235 v_ArrVal_2288)))) (let ((.cse231 (select (select .cse232 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse230 (select |c_#length| .cse231))) (not (= .cse231 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse232 .cse231 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse230))))) (not (bvule .cse236 (select |c_#length| .cse234))) (not (= .cse234 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule .cse235 .cse236))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse237 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse238 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse237 .cse238)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse245 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse246 (select (select .cse245 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse240 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse247 (select .cse245 .cse246))) (let ((.cse244 (store .cse245 .cse246 (store .cse247 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288))) (.cse243 (store .cse245 .cse246 (store .cse247 .cse237 v_ArrVal_2288)))) (let ((.cse241 (select (select .cse243 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse239 (select (select .cse244 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse239) (not (bvule .cse240 (select |c_#length| .cse241))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse242 (select |c_#length| (select (select (store .cse244 .cse239 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse242) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse242) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse243 .cse241 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse240))))) (not (bvule .cse238 (select |c_#length| .cse246))) (not (= .cse246 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse249 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse248 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse248 .cse249)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse259 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse250 (select (select .cse259 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse249 (select |c_#length| .cse250))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse251 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse260 (select .cse259 .cse250))) (let ((.cse257 (store .cse259 .cse250 (store .cse260 .cse248 v_ArrVal_2288)))) (let ((.cse252 (select (select .cse257 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse251 (select |c_#length| .cse252))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse254 (select |c_#length| (select (select (let ((.cse258 (store .cse259 .cse250 (store .cse260 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (store .cse258 (select (select .cse258 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse253 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse256 (select |c_#length| (select (select (store .cse257 .cse252 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse253 .cse254) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse255 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse255 .cse256) (bvule .cse255 .cse254)))) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse254) (bvule .cse253 .cse256))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse251))))) (not (= .cse250 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse262 (bvadd v_arrayElimCell_135 (_ bv11 64))) (.cse261 (bvadd (_ bv10 64) v_arrayElimCell_135))) (or (not (bvule .cse261 .cse262)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse270 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse263 (select (select .cse270 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse262 (select |c_#length| .cse263))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse265 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse271 (select .cse270 .cse263))) (let ((.cse269 (store .cse270 .cse263 (store .cse271 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288))) (.cse267 (store .cse270 .cse263 (store .cse271 .cse261 v_ArrVal_2288)))) (let ((.cse266 (select (select .cse267 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse264 (select (select .cse269 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse264) (not (bvule .cse265 (select |c_#length| .cse266))) (not (= .cse266 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse268 (select |c_#length| (select (select (store .cse269 .cse264 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse267 .cse266 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse268) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse268))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse265))))) (not (= .cse263 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse281 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse272 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse279 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse273 (select (select .cse279 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse272 (select |c_#length| .cse273))) (not (= .cse273 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse278 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse280 (select .cse279 .cse273))) (let ((.cse276 (store .cse279 .cse273 (store .cse280 .cse281 v_ArrVal_2288))) (.cse275 (store .cse279 .cse273 (store .cse280 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse274 (select (select .cse275 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse277 (select (select .cse276 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse274) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse275 .cse274 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse276 .cse277 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))) (not (bvule .cse278 (select |c_#length| .cse277))) (= .cse277 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse278))))))))) (not (bvule .cse281 .cse272))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse282 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse283 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse282 .cse283)) (forall ((v_arrayElimCell_134 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse288 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse289 (select (select .cse288 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse285 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse290 (select .cse288 .cse289))) (let ((.cse287 (store .cse288 .cse289 (store .cse290 (bvadd (_ bv10 64) v_arrayElimCell_134) v_ArrVal_2288)))) (let ((.cse286 (select (select (store .cse288 .cse289 (store .cse290 .cse282 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse284 (select (select .cse287 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse284) (not (bvule .cse285 (select |c_#length| .cse286))) (= .cse286 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse287 .cse284 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse285))))) (not (bvule .cse283 (select |c_#length| .cse289))) (not (= .cse289 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_135 (_ BitVec 64))) (let ((.cse291 (bvadd (_ bv10 64) v_arrayElimCell_135)) (.cse292 (bvadd v_arrayElimCell_135 (_ bv11 64)))) (or (not (bvule .cse291 .cse292)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse297 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse298 (select (select .cse297 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse293 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse296 (store .cse297 .cse298 (store (select .cse297 .cse298) .cse291 v_ArrVal_2288)))) (let ((.cse294 (select (select .cse296 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse293 (select |c_#length| .cse294))) (= .cse294 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse295 (select |c_#length| (select (select (store .cse296 .cse294 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse295) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse295)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse293))))) (not (bvule .cse292 (select |c_#length| .cse298))) (not (= .cse298 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))))) .cse299) (or (and (forall ((v_arrayElimCell_132 (_ BitVec 64))) (let ((.cse300 (bvadd (_ bv10 64) v_arrayElimCell_132)) (.cse301 (bvadd v_arrayElimCell_132 (_ bv11 64)))) (or (not (bvule .cse300 .cse301)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse302 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse303 (select (select .cse302 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_131 (_ BitVec 64))) (or (bvule (bvadd v_arrayElimCell_131 .cse11) (bvadd v_arrayElimCell_131 .cse11 (_ bv1 64))) (forall ((v_ArrVal_2288 (_ BitVec 64))) (not (bvule (bvadd .cse2 v_arrayElimCell_131 (_ bv1 64)) (select |c_#length| (select (select (store .cse302 .cse303 (store (select .cse302 .cse303) .cse300 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))) (not (bvule .cse301 (select |c_#length| .cse303))) (not (= .cse303 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_132 (_ BitVec 64))) (or (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse304 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse305 (select (select .cse304 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_132 (_ bv1 64)) (select |c_#length| (select (select (store .cse304 .cse305 (store (select .cse304 .cse305) (bvadd (_ bv10 64) v_arrayElimCell_132) v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (= .cse305 |c_ULTIMATE.start_main_~argv~0#1.base|))))) (bvule (bvadd v_arrayElimCell_132 .cse11) (bvadd v_arrayElimCell_132 .cse11 (_ bv1 64))))) (forall ((v_arrayElimCell_132 (_ BitVec 64))) (let ((.cse307 (bvadd v_arrayElimCell_132 (_ bv11 64))) (.cse306 (bvadd (_ bv10 64) v_arrayElimCell_132))) (or (not (bvule .cse306 .cse307)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse311 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse308 (select (select .cse311 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse307 (select |c_#length| .cse308))) (forall ((v_arrayElimCell_131 (_ BitVec 64))) (let ((.cse309 (bvadd .cse2 v_arrayElimCell_131 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_131) .cse309)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse310 (select (select (store .cse311 .cse308 (store (select .cse311 .cse308) .cse306 v_ArrVal_2288)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse309 (select |c_#length| .cse310))) (not (= .cse310 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))) (not (= .cse308 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))))) .cse299) (or .cse15 (and (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse313 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse312 (bvadd (_ bv10 64) v_arrayElimCell_134))) (or (not (bvule .cse312 .cse313)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse320 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse314 (select (select .cse320 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse313 (select |c_#length| .cse314))) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse319 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse321 (select .cse320 .cse314))) (let ((.cse315 (store .cse320 .cse314 (store .cse321 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288))) (.cse317 (store .cse320 .cse314 (store .cse321 .cse312 v_ArrVal_2288)))) (let ((.cse318 (select (select .cse317 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse316 (select (select .cse315 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse315 .cse316 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse317 .cse318 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))) (not (bvule .cse319 (select |c_#length| .cse318))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse318)) (= .cse316 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse319))))) (not (= .cse314 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse324 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64))) (.cse322 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse323 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse322 .cse323)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse324)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse328 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse329 (select (select .cse328 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse330 (select .cse328 .cse329))) (let ((.cse331 (store .cse328 .cse329 (store .cse330 .cse322 v_ArrVal_2288)))) (let ((.cse325 (select (select .cse331 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse324 (select |c_#length| .cse325))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse326 (select |c_#length| (select (select (store .cse331 .cse325 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse326) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse326) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse327 (store .cse328 .cse329 (store .cse330 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse327 (select (select .cse327 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))))) (= .cse329 |c_ULTIMATE.start_main_~argv~0#1.base|) (not (bvule .cse323 (select |c_#length| .cse329)))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse332 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse333 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse332 .cse333)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse338 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse339 (select (select .cse338 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse334 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse337 (store .cse338 .cse339 (store (select .cse338 .cse339) .cse332 v_ArrVal_2288)))) (let ((.cse335 (select (select .cse337 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse334 (select |c_#length| .cse335))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse335) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse336 (select |c_#length| (select (select (store .cse337 .cse335 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse336) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse336)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse334))))) (not (bvule .cse333 (select |c_#length| .cse339))) (not (= .cse339 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse340 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse341 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse340 .cse341)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse349 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse350 (select (select .cse349 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse348 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse351 (select .cse349 .cse350))) (let ((.cse344 (store .cse349 .cse350 (store .cse351 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288))) (.cse346 (store .cse349 .cse350 (store .cse351 .cse340 v_ArrVal_2288)))) (let ((.cse347 (select (select .cse346 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse345 (select (select .cse344 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse342 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse343 (select |c_#length| (select (select (store .cse346 .cse347 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse342 .cse343) (bvule .cse342 (select |c_#length| (select (select (store .cse344 .cse345 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse343)))) (not (bvule .cse348 (select |c_#length| .cse347))) (= .cse345 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse348))))) (not (bvule .cse341 (select |c_#length| .cse350))) (not (= .cse350 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse352 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse353 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse352 .cse353)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse358 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse359 (select (select .cse358 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse354 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse360 (select .cse358 .cse359))) (let ((.cse361 (store .cse358 .cse359 (store .cse360 .cse352 v_ArrVal_2288)))) (let ((.cse355 (select (select .cse361 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse354 (select |c_#length| .cse355))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse355) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse356 (select |c_#length| (select (select (store .cse361 .cse355 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse356) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse356) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse357 (store .cse358 .cse359 (store .cse360 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse357 (select (select .cse357 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse354))))) (not (bvule .cse353 (select |c_#length| .cse359))) (not (= .cse359 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse362 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse363 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse362 .cse363)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse371 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse372 (select (select .cse371 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse364 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse373 (select .cse371 .cse372))) (let ((.cse374 (store .cse371 .cse372 (store .cse373 .cse362 v_ArrVal_2288)))) (let ((.cse365 (select (select .cse374 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse364 (select |c_#length| .cse365))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse367 (select |c_#length| (select (select (store .cse374 .cse365 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse366 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse369 (select |c_#length| (select (select (let ((.cse370 (store .cse371 .cse372 (store .cse373 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse370 (select (select .cse370 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse366 .cse367) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse368 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse368 .cse369) (bvule .cse368 .cse367)))) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse367) (bvule .cse366 .cse369))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse364))))) (not (bvule .cse363 (select |c_#length| .cse372))) (not (= .cse372 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse375 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse376 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse375 .cse376)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse383 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse384 (select (select .cse383 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse377 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse385 (select .cse383 .cse384))) (let ((.cse382 (store .cse383 .cse384 (store .cse385 .cse375 v_ArrVal_2288))) (.cse380 (store .cse383 .cse384 (store .cse385 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (let ((.cse379 (select (select .cse380 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse378 (select (select .cse382 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse377 (select |c_#length| .cse378))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse378) (not (= .cse379 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse381 (select |c_#length| (select (select (store .cse382 .cse378 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse380 .cse379 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse381) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse381))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse377))))) (not (bvule .cse376 (select |c_#length| .cse384))) (not (= .cse384 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse387 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse386 (bvadd (_ bv10 64) v_arrayElimCell_134))) (or (not (bvule .cse386 .cse387)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse392 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse388 (select (select .cse392 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse387 (select |c_#length| .cse388))) (not (= .cse388 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse389 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse391 (store .cse392 .cse388 (store (select .cse392 .cse388) .cse386 v_ArrVal_2288)))) (let ((.cse390 (select (select .cse391 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse389 (select |c_#length| .cse390))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse390) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse391 .cse390 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse389)))))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse395 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64))) (.cse393 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse394 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse393 .cse394)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse395)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse399 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse396 (select (select .cse399 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse396 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse398 (store .cse399 .cse396 (store (select .cse399 .cse396) .cse393 v_ArrVal_2288)))) (let ((.cse397 (select (select .cse398 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse395 (select |c_#length| .cse397))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse398 .cse397 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))) (not (bvule .cse394 (select |c_#length| .cse396)))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse401 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse400 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse402 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64)))) (or (not (bvule .cse400 .cse401)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2288 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_137 (_ BitVec 64)) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse407 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse405 (select (select .cse407 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse406 (store .cse407 .cse405 (store (select .cse407 .cse405) .cse400 v_ArrVal_2288)))) (let ((.cse403 (select (select .cse406 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse404 (select |c_#length| (select (select (store .cse406 .cse403 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (not (bvule .cse402 (select |c_#length| .cse403))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse404) (= .cse405 |c_ULTIMATE.start_main_~argv~0#1.base|) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse404) (not (bvule .cse401 (select |c_#length| .cse405))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse404)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse402))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse408 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse409 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse408 .cse409)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse416 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse417 (select (select .cse416 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse410 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse418 (select .cse416 .cse417))) (let ((.cse414 (store .cse416 .cse417 (store .cse418 .cse408 v_ArrVal_2288)))) (let ((.cse411 (select (select .cse414 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse410 (select |c_#length| .cse411))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse411)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse413 (select |c_#length| (select (select (let ((.cse415 (store .cse416 .cse417 (store .cse418 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse415 (select (select .cse415 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse412 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse412 .cse413) (bvule .cse412 (select |c_#length| (select (select (store .cse414 .cse411 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse413))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse410))))) (not (bvule .cse409 (select |c_#length| .cse417))) (not (= .cse417 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse419 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse420 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse419 .cse420)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse425 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse426 (select (select .cse425 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse424 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse422 (store .cse425 .cse426 (store (select .cse425 .cse426) .cse419 v_ArrVal_2288)))) (let ((.cse423 (select (select .cse422 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse421 (select |c_#length| (select (select (store .cse422 .cse423 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse421) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse421)))) (not (bvule .cse424 (select |c_#length| .cse423))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse424))))) (not (bvule .cse420 (select |c_#length| .cse426))) (not (= .cse426 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse436 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse437 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse435 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64)))) (or (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse431 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse427 (select (select .cse431 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse427 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse432 (select .cse431 .cse427))) (let ((.cse433 (store .cse431 .cse427 (store .cse432 .cse436 v_ArrVal_2288)))) (let ((.cse434 (select (select .cse433 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse428 (select |c_#length| (select (select (store .cse433 .cse434 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse429 (select |c_#length| (select (select (let ((.cse430 (store .cse431 .cse427 (store .cse432 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse430 (select (select .cse430 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse428) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse428) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse429)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse429)))) (not (bvule .cse435 (select |c_#length| .cse434)))))))) (not (bvule .cse437 (select |c_#length| .cse427))))))) (not (bvule .cse436 .cse437)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse435))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse438 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse439 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse438 .cse439)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse444 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse445 (select (select .cse444 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64)) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse443 (store .cse444 .cse445 (store (select .cse444 .cse445) .cse438 v_ArrVal_2288)))) (let ((.cse441 (select (select .cse443 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse440 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64))) (.cse442 (select |c_#length| (select (select (store .cse443 .cse441 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (not (bvule .cse440 (select |c_#length| .cse441))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse442) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse442) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse440)) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse442)))))) (not (bvule .cse439 (select |c_#length| .cse445))) (not (= .cse445 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse446 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse447 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse446 .cse447)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse452 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse453 (select (select .cse452 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse448 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse448)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse454 (select .cse452 .cse453))) (let ((.cse449 (store .cse452 .cse453 (store .cse454 .cse446 v_ArrVal_2288)))) (let ((.cse450 (select (select .cse449 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse449 .cse450 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse451 (store .cse452 .cse453 (store .cse454 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse451 (select (select .cse451 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))) (not (bvule .cse448 (select |c_#length| .cse450))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse450))))))))) (not (bvule .cse447 (select |c_#length| .cse453))) (not (= .cse453 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse455 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse456 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse455 .cse456)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse464 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse465 (select (select .cse464 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse457 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse457)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse466 (select .cse464 .cse465))) (let ((.cse463 (store .cse464 .cse465 (store .cse466 .cse455 v_ArrVal_2288))) (.cse461 (store .cse464 .cse465 (store .cse466 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (let ((.cse459 (select (select .cse461 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse458 (select (select .cse463 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse457 (select |c_#length| .cse458))) (not (= .cse459 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse460 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64))) (.cse462 (select |c_#length| (select (select (store .cse463 .cse458 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse460 (select |c_#length| (select (select (store .cse461 .cse459 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse462) (bvule .cse460 .cse462)))))))))))) (not (bvule .cse456 (select |c_#length| .cse465))) (not (= .cse465 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse467 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse468 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse467 .cse468)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse474 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse475 (select (select .cse474 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse479 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse476 (select .cse474 .cse475))) (let ((.cse477 (store .cse474 .cse475 (store .cse476 .cse467 v_ArrVal_2288)))) (let ((.cse478 (select (select .cse477 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse470 (select |c_#length| (select (select (store .cse477 .cse478 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse469 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse472 (select |c_#length| (select (select (let ((.cse473 (store .cse474 .cse475 (store .cse476 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse473 (select (select .cse473 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse469 .cse470) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse471 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)))) (or (bvule .cse471 .cse472) (bvule .cse471 .cse470)))) (bvule .cse469 .cse472)))) (not (bvule .cse479 (select |c_#length| .cse478)))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse479))))) (not (bvule .cse468 (select |c_#length| .cse475))) (not (= .cse475 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse482 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64))) (.cse480 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse481 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse480 .cse481)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse482)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse487 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse483 (select (select .cse487 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse483 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse486 (store .cse487 .cse483 (store (select .cse487 .cse483) .cse480 v_ArrVal_2288)))) (let ((.cse484 (select (select .cse486 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse482 (select |c_#length| .cse484))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse485 (select |c_#length| (select (select (store .cse486 .cse484 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse485) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse485)))))))) (not (bvule .cse481 (select |c_#length| .cse483)))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse496 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse489 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse490 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64)))) (or (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse494 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse488 (select (select .cse494 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse488 |c_ULTIMATE.start_main_~argv~0#1.base|) (not (bvule .cse489 (select |c_#length| .cse488))) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse495 (select .cse494 .cse488))) (let ((.cse492 (store .cse494 .cse488 (store .cse495 .cse496 v_ArrVal_2288)))) (let ((.cse491 (select (select .cse492 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse490 (select |c_#length| .cse491))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse492 .cse491 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (let ((.cse493 (store .cse494 .cse488 (store .cse495 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse493 (select (select .cse493 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))))) (not (bvule .cse496 .cse489)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse490))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse498 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse497 (bvadd (_ bv10 64) v_arrayElimCell_134))) (or (not (bvule .cse497 .cse498)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse507 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse499 (select (select .cse507 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse498 (select |c_#length| .cse499))) (not (= .cse499 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse500 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse508 (select .cse507 .cse499))) (let ((.cse506 (store .cse507 .cse499 (store .cse508 .cse497 v_ArrVal_2288))) (.cse505 (store .cse507 .cse499 (store .cse508 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (let ((.cse502 (select (select .cse505 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse501 (select (select .cse506 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse500 (select |c_#length| .cse501))) (= .cse502 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse503 (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64))) (.cse504 (select |c_#length| (select (select (store .cse506 .cse501 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule .cse503 .cse504) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse504) (bvule .cse503 (select |c_#length| (select (select (store .cse505 .cse502 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse504))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse500)))))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse510 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse511 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64))) (.cse509 (bvadd (_ bv10 64) v_arrayElimCell_134))) (or (not (bvule .cse509 .cse510)) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse511)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse516 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse512 (select (select .cse516 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse512 |c_ULTIMATE.start_main_~argv~0#1.base|) (not (bvule .cse510 (select |c_#length| .cse512))) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse515 (store .cse516 .cse512 (store (select .cse516 .cse512) .cse509 v_ArrVal_2288)))) (let ((.cse513 (select (select .cse515 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse511 (select |c_#length| .cse513))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse514 (select |c_#length| (select (select (store .cse515 .cse513 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse514) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse514))))))))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse518 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse517 (bvadd (_ bv10 64) v_arrayElimCell_134))) (or (not (bvule .cse517 .cse518)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse525 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse519 (select (select .cse525 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse518 (select |c_#length| .cse519))) (not (= .cse519 |c_ULTIMATE.start_main_~argv~0#1.base|)) (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse520 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse526 (select .cse525 .cse519))) (let ((.cse523 (store .cse525 .cse519 (store .cse526 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288))) (.cse522 (store .cse525 .cse519 (store .cse526 .cse517 v_ArrVal_2288)))) (let ((.cse521 (select (select .cse522 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse524 (select (select .cse523 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse520 (select |c_#length| .cse521))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse521) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse522 .cse521 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse523 .cse524 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))) (= .cse524 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse520)))))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse528 (bvadd v_arrayElimCell_134 (_ bv11 64))) (.cse527 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse530 (bvadd .cse2 v_arrayElimCell_134 (_ bv1 64)))) (or (not (bvule .cse527 .cse528)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse535 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse529 (select (select .cse535 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (= .cse529 |c_ULTIMATE.start_main_~argv~0#1.base|) (not (bvule .cse528 (select |c_#length| .cse529))) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse536 (select .cse535 .cse529))) (let ((.cse532 (store .cse535 .cse529 (store .cse536 .cse527 v_ArrVal_2288)))) (let ((.cse531 (select (select .cse532 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse530 (select |c_#length| .cse531))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse533 (select |c_#length| (select (select (let ((.cse534 (store .cse535 .cse529 (store .cse536 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse534 (select (select .cse534 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse532 .cse531 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse533)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse533))))))))))))) (not (bvule (bvadd .cse2 v_arrayElimCell_134) .cse530))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse537 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse538 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse537 .cse538)) (forall ((v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse542 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse543 (select (select .cse542 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse539 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse539)) (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse541 (store .cse542 .cse543 (store (select .cse542 .cse543) .cse537 v_ArrVal_2288)))) (let ((.cse540 (select (select .cse541 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse539 (select |c_#length| .cse540))) (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) (select |c_#length| (select (select (store .cse541 .cse540 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse540))))))))) (not (bvule .cse538 (select |c_#length| .cse543))) (not (= .cse543 |c_ULTIMATE.start_main_~argv~0#1.base|))))))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse553 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse554 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse547 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse548 (select (select .cse547 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_arrayElimCell_137 (_ BitVec 64))) (let ((.cse552 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64)))) (or (forall ((v_ArrVal_2288 (_ BitVec 64))) (let ((.cse549 (select .cse547 .cse548))) (let ((.cse550 (store .cse547 .cse548 (store .cse549 .cse553 v_ArrVal_2288)))) (let ((.cse551 (select (select .cse550 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse544 (select |c_#length| (select (select (store .cse550 .cse551 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse545 (select |c_#length| (select (select (let ((.cse546 (store .cse547 .cse548 (store .cse549 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (store .cse546 (select (select .cse546 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2291)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse544) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse544) (forall ((v_arrayElimCell_136 (_ BitVec 64))) (bvule (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64)) .cse545)) (bvule (bvadd v_arrayElimCell_135 .cse11 (_ bv1 64)) .cse545)))) (not (bvule .cse552 (select |c_#length| .cse551))) (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse551)))))) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse552))))) (not (bvule .cse554 (select |c_#length| .cse548))) (not (= .cse548 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (not (bvule .cse553 .cse554))))) (forall ((v_arrayElimCell_134 (_ BitVec 64))) (let ((.cse555 (bvadd (_ bv10 64) v_arrayElimCell_134)) (.cse556 (bvadd v_arrayElimCell_134 (_ bv11 64)))) (or (not (bvule .cse555 .cse556)) (forall ((v_arrayElimCell_135 (_ BitVec 64)) (v_ArrVal_2286 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse564 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2286))) (let ((.cse565 (select (select .cse564 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_2291 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2288 (_ BitVec 64)) (v_arrayElimCell_137 (_ BitVec 64)) (v_arrayElimCell_136 (_ BitVec 64))) (let ((.cse566 (select .cse564 .cse565))) (let ((.cse563 (store .cse564 .cse565 (store .cse566 .cse555 v_ArrVal_2288)))) (let ((.cse558 (select (select .cse563 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse560 (store .cse564 .cse565 (store .cse566 (bvadd (_ bv10 64) v_arrayElimCell_135) v_ArrVal_2288)))) (let ((.cse561 (select (select .cse560 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (.cse557 (bvadd .cse2 v_arrayElimCell_137 (_ bv1 64))) (.cse559 (bvadd v_arrayElimCell_136 .cse11 (_ bv1 64))) (.cse562 (select |c_#length| (select (select (store .cse563 .cse558 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (or (not (bvule .cse557 (select |c_#length| .cse558))) (bvule .cse559 (select |c_#length| (select (select (store .cse560 .cse561 v_ArrVal_2291) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd v_arrayElimCell_137 .cse11 (_ bv1 64)) .cse562) (bvule (bvadd v_arrayElimCell_134 .cse11 (_ bv1 64)) .cse562) (not (= .cse561 |c_ULTIMATE.start_main_~argv~0#1.base|)) (not (bvule (bvadd .cse2 v_arrayElimCell_137) .cse557)) (bvule .cse559 .cse562))))))) (not (bvule .cse556 (select |c_#length| .cse565))) (not (= .cse565 |c_ULTIMATE.start_main_~argv~0#1.base|)))))))))))))) is different from true [2023-12-02 15:50:58,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:50:58,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1030 treesize of output 549 [2023-12-02 15:50:58,354 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 15:50:58,556 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:50:58,557 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 4153 treesize of output 3511 [2023-12-02 15:50:58,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 714 treesize of output 623 [2023-12-02 15:50:58,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 865 treesize of output 809 [2023-12-02 15:50:58,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1253 treesize of output 1071