./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/linux-list-fst-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/linux-list-fst-data.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje --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 2c99ca0700d3067c5b23f9ea1940dd43a17b3da467130e3c19500119915a8761 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:29:48,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:29:48,233 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-09 05:29:48,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:29:48,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:29:48,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:29:48,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:29:48,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:29:48,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:29:48,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:29:48,287 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:29:48,287 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:29:48,288 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:29:48,289 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:29:48,291 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:29:48,291 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:29:48,292 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:29:48,292 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:29:48,293 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:29:48,293 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:29:48,293 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:29:48,298 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:29:48,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:29:48,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:29:48,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:29:48,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:29:48,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:29:48,300 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:29:48,300 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:29:48,301 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:29:48,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:29:48,302 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:29:48,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:29:48,303 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:29:48,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:29:48,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:29:48,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:29:48,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:29:48,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:29:48,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:29:48,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:29:48,306 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:29:48,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:29:48,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:29:48,307 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:29:48,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:29:48,307 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_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje 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 -> 2c99ca0700d3067c5b23f9ea1940dd43a17b3da467130e3c19500119915a8761 [2024-11-09 05:29:48,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:29:48,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:29:48,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:29:48,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:29:48,602 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:29:48,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/memsafety-broom/linux-list-fst-data.i Unable to find full path for "g++" [2024-11-09 05:29:50,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:29:51,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:29:51,024 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/sv-benchmarks/c/memsafety-broom/linux-list-fst-data.i [2024-11-09 05:29:51,050 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/data/4b8e675b3/51478298ac1e479bbaa362b0e6826e95/FLAGfd1965934 [2024-11-09 05:29:51,065 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/data/4b8e675b3/51478298ac1e479bbaa362b0e6826e95 [2024-11-09 05:29:51,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:29:51,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:29:51,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:29:51,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:29:51,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:29:51,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:29:51" (1/1) ... [2024-11-09 05:29:51,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4975c894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:51, skipping insertion in model container [2024-11-09 05:29:51,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:29:51" (1/1) ... [2024-11-09 05:29:51,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:29:51,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:29:51,537 ERROR L321 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) [2024-11-09 05:29:51,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a1519f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:51, skipping insertion in model container [2024-11-09 05:29:51,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:29:51,539 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 05:29:51,541 INFO L158 Benchmark]: Toolchain (without parser) took 470.83ms. Allocated memory is still 138.4MB. Free memory was 95.0MB in the beginning and 76.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 05:29:51,541 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 138.4MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:29:51,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.46ms. Allocated memory is still 138.4MB. Free memory was 95.0MB in the beginning and 77.1MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 05:29:51,545 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.31ms. Allocated memory is still 138.4MB. Free memory is still 83.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.46ms. Allocated memory is still 138.4MB. Free memory was 95.0MB in the beginning and 77.1MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2490]: 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_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/linux-list-fst-data.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje --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 2c99ca0700d3067c5b23f9ea1940dd43a17b3da467130e3c19500119915a8761 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:29:53,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:29:53,944 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Bitvector.epf [2024-11-09 05:29:53,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:29:53,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:29:53,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:29:53,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:29:53,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:29:53,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:29:54,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:29:54,004 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:29:54,005 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:29:54,005 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:29:54,006 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:29:54,006 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:29:54,006 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:29:54,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:29:54,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:29:54,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:29:54,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:29:54,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:29:54,011 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:29:54,012 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:29:54,012 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:29:54,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:29:54,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:29:54,013 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 05:29:54,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:29:54,014 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 05:29:54,014 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:29:54,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:29:54,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:29:54,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 05:29:54,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:29:54,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:29:54,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:29:54,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:29:54,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:29:54,020 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 05:29:54,020 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 05:29:54,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:29:54,021 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:29:54,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje 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 -> 2c99ca0700d3067c5b23f9ea1940dd43a17b3da467130e3c19500119915a8761 [2024-11-09 05:29:54,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:29:54,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:29:54,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:29:54,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:29:54,497 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:29:54,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/memsafety-broom/linux-list-fst-data.i Unable to find full path for "g++" [2024-11-09 05:29:56,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:29:56,992 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:29:56,993 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/sv-benchmarks/c/memsafety-broom/linux-list-fst-data.i [2024-11-09 05:29:57,033 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/data/4f7b631a5/b0f830f695844c53a2aa15044d0a36c1/FLAGf7e16394a [2024-11-09 05:29:57,053 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/data/4f7b631a5/b0f830f695844c53a2aa15044d0a36c1 [2024-11-09 05:29:57,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:29:57,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:29:57,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:29:57,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:29:57,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:29:57,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:57,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574824af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57, skipping insertion in model container [2024-11-09 05:29:57,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:57,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:29:57,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:29:57,711 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 05:29:57,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:29:57,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:29:57,816 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:29:57,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:29:57,916 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:29:57,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57 WrapperNode [2024-11-09 05:29:57,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:29:57,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:29:57,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:29:57,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:29:57,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:57,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:57,970 INFO L138 Inliner]: procedures = 125, calls = 33, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 98 [2024-11-09 05:29:57,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:29:57,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:29:57,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:29:57,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:29:57,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:57,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:57,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:57,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:58,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:58,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:58,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:58,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:58,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:29:58,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:29:58,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:29:58,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:29:58,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (1/1) ... [2024-11-09 05:29:58,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:29:58,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:29:58,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:29:58,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:29:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:29:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:29:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:29:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:29:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 05:29:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:29:58,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:29:58,318 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:29:58,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:29:59,047 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2024-11-09 05:29:59,048 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:29:59,067 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:29:59,067 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 05:29:59,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:29:59 BoogieIcfgContainer [2024-11-09 05:29:59,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:29:59,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:29:59,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:29:59,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:29:59,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:29:57" (1/3) ... [2024-11-09 05:29:59,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e10f4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:29:59, skipping insertion in model container [2024-11-09 05:29:59,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:57" (2/3) ... [2024-11-09 05:29:59,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e10f4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:29:59, skipping insertion in model container [2024-11-09 05:29:59,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:29:59" (3/3) ... [2024-11-09 05:29:59,097 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-list-fst-data.i [2024-11-09 05:29:59,121 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:29:59,122 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2024-11-09 05:29:59,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:29:59,188 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5134f154, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:29:59,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2024-11-09 05:29:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 53 states have (on average 2.0) internal successors, (106), 98 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:29:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:29:59,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:29:59,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:29:59,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:29:59,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:29:59,208 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-09 05:29:59,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:29:59,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678570495] [2024-11-09 05:29:59,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:59,223 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 [2024-11-09 05:29:59,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:29:59,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:29:59,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:29:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:59,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:29:59,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:29:59,420 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 [2024-11-09 05:29:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:29:59,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:29:59,442 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:29:59,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678570495] [2024-11-09 05:29:59,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678570495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:29:59,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:29:59,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:29:59,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514018964] [2024-11-09 05:29:59,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:29:59,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:29:59,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:29:59,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:29:59,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:29:59,498 INFO L87 Difference]: Start difference. First operand has 99 states, 53 states have (on average 2.0) internal successors, (106), 98 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:29:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:29:59,855 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2024-11-09 05:29:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:29:59,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-09 05:29:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:29:59,868 INFO L225 Difference]: With dead ends: 97 [2024-11-09 05:29:59,869 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 05:29:59,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:29:59,875 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 27 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:29:59,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 121 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:29:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 05:29:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 05:29:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 94 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:29:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-09 05:29:59,916 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 3 [2024-11-09 05:29:59,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:29:59,916 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-09 05:29:59,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:29:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-09 05:29:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 05:29:59,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:29:59,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 05:29:59,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:30:00,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:00,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:00,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2024-11-09 05:30:00,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:00,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264601166] [2024-11-09 05:30:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:00,126 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 [2024-11-09 05:30:00,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:00,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:00,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:00,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:30:00,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:00,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:30:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:00,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:00,238 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:00,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264601166] [2024-11-09 05:30:00,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264601166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:00,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:00,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:30:00,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568296456] [2024-11-09 05:30:00,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:00,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:30:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:30:00,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:30:00,242 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:00,683 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2024-11-09 05:30:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:30:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-09 05:30:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:00,685 INFO L225 Difference]: With dead ends: 96 [2024-11-09 05:30:00,686 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 05:30:00,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:30:00,687 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:00,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 148 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:30:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 05:30:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2024-11-09 05:30:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-09 05:30:00,706 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 3 [2024-11-09 05:30:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:00,706 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-09 05:30:00,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-09 05:30:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 05:30:00,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:00,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:00,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:00,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:00,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:00,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:00,911 INFO L85 PathProgramCache]: Analyzing trace with hash 148077583, now seen corresponding path program 1 times [2024-11-09 05:30:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:00,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495021305] [2024-11-09 05:30:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:00,912 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 [2024-11-09 05:30:00,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:00,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:00,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:01,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:30:01,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:01,027 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 [2024-11-09 05:30:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:01,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:01,039 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:01,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495021305] [2024-11-09 05:30:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495021305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:01,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:01,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:30:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604553885] [2024-11-09 05:30:01,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:01,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:30:01,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:30:01,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:30:01,042 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:01,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:01,259 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-09 05:30:01,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:30:01,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 05:30:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:01,260 INFO L225 Difference]: With dead ends: 92 [2024-11-09 05:30:01,261 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 05:30:01,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:30:01,262 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:01,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:30:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 05:30:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 05:30:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 91 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-09 05:30:01,270 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 8 [2024-11-09 05:30:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:01,270 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-09 05:30:01,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-09 05:30:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 05:30:01,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:01,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:01,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:01,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:01,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:01,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash 148077584, now seen corresponding path program 1 times [2024-11-09 05:30:01,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:01,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137691853] [2024-11-09 05:30:01,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:01,475 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 [2024-11-09 05:30:01,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:01,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:01,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:01,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:30:01,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:01,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:30:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:01,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:01,601 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:01,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137691853] [2024-11-09 05:30:01,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137691853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:01,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:01,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:30:01,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214582572] [2024-11-09 05:30:01,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:01,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:30:01,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:01,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:30:01,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:30:01,604 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:01,982 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2024-11-09 05:30:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:30:01,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 05:30:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:01,987 INFO L225 Difference]: With dead ends: 91 [2024-11-09 05:30:01,987 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 05:30:01,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:30:01,988 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:01,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:30:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 05:30:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 05:30:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-09 05:30:02,001 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 8 [2024-11-09 05:30:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:02,002 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-09 05:30:02,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-09 05:30:02,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:30:02,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:02,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:02,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:02,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:02,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:02,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:02,209 INFO L85 PathProgramCache]: Analyzing trace with hash 568603693, now seen corresponding path program 1 times [2024-11-09 05:30:02,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:02,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532589606] [2024-11-09 05:30:02,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:02,210 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 [2024-11-09 05:30:02,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:02,216 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:02,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (6)] Waiting until timeout for monitored process [2024-11-09 05:30:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:02,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:30:02,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:02,301 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 [2024-11-09 05:30:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:02,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:02,373 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:02,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532589606] [2024-11-09 05:30:02,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532589606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:02,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:02,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:30:02,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055525466] [2024-11-09 05:30:02,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:02,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:30:02,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:02,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:30:02,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:02,375 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:02,932 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2024-11-09 05:30:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:30:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 05:30:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:02,935 INFO L225 Difference]: With dead ends: 90 [2024-11-09 05:30:02,935 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 05:30:02,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:02,938 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 29 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:02,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 185 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:30:02,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 05:30:02,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 05:30:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 89 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2024-11-09 05:30:02,950 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 10 [2024-11-09 05:30:02,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:02,950 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2024-11-09 05:30:02,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2024-11-09 05:30:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:30:02,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:02,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:02,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:03,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:03,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:03,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:03,155 INFO L85 PathProgramCache]: Analyzing trace with hash 568603694, now seen corresponding path program 1 times [2024-11-09 05:30:03,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:03,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392280205] [2024-11-09 05:30:03,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:03,156 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 [2024-11-09 05:30:03,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:03,159 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:03,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (7)] Waiting until timeout for monitored process [2024-11-09 05:30:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:03,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 05:30:03,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:03,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:30:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:03,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:03,416 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:03,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392280205] [2024-11-09 05:30:03,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392280205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:03,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:03,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:30:03,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843121521] [2024-11-09 05:30:03,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:03,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:30:03,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:03,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:30:03,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:03,418 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:03,991 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2024-11-09 05:30:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:30:03,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 05:30:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:03,995 INFO L225 Difference]: With dead ends: 103 [2024-11-09 05:30:03,995 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 05:30:03,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:03,996 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:03,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 232 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:30:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 05:30:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2024-11-09 05:30:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-09 05:30:04,011 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 10 [2024-11-09 05:30:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:04,011 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-09 05:30:04,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-09 05:30:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:30:04,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:04,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:04,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (7)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:04,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:04,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:04,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:04,214 INFO L85 PathProgramCache]: Analyzing trace with hash 568636496, now seen corresponding path program 1 times [2024-11-09 05:30:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:04,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923668230] [2024-11-09 05:30:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:04,215 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 [2024-11-09 05:30:04,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:04,218 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:04,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:04,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:30:04,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:04,380 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 [2024-11-09 05:30:04,441 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 05:30:04,441 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 [2024-11-09 05:30:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:04,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:04,477 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:04,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923668230] [2024-11-09 05:30:04,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923668230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:04,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:30:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541802108] [2024-11-09 05:30:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:04,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:30:04,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:30:04,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:30:04,480 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:04,846 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-11-09 05:30:04,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:30:04,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 05:30:04,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:04,847 INFO L225 Difference]: With dead ends: 94 [2024-11-09 05:30:04,847 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 05:30:04,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:04,848 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 20 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:04,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 161 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:30:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 05:30:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 05:30:04,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.736842105263158) internal successors, (99), 93 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-09 05:30:04,854 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 10 [2024-11-09 05:30:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:04,854 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-09 05:30:04,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-09 05:30:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:30:04,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:04,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:04,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:05,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:05,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:05,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash 568636497, now seen corresponding path program 1 times [2024-11-09 05:30:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:05,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883579748] [2024-11-09 05:30:05,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:05,057 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 [2024-11-09 05:30:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:05,060 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:05,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 05:30:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:05,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 05:30:05,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:05,233 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 [2024-11-09 05:30:05,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:30:05,388 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:30:05,389 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 13 [2024-11-09 05:30:05,420 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:30:05,421 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 [2024-11-09 05:30:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:05,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:05,500 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:05,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883579748] [2024-11-09 05:30:05,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883579748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:05,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:05,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:30:05,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904424913] [2024-11-09 05:30:05,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:05,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:30:05,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:05,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:30:05,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:05,502 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:06,258 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2024-11-09 05:30:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:30:06,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 05:30:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:06,259 INFO L225 Difference]: With dead ends: 93 [2024-11-09 05:30:06,260 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 05:30:06,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:30:06,261 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 20 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:06,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 194 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 05:30:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 05:30:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 05:30:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.719298245614035) internal successors, (98), 92 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2024-11-09 05:30:06,273 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 10 [2024-11-09 05:30:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:06,273 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2024-11-09 05:30:06,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2024-11-09 05:30:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:30:06,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:06,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:06,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:30:06,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:06,479 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:06,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:06,480 INFO L85 PathProgramCache]: Analyzing trace with hash 998826193, now seen corresponding path program 1 times [2024-11-09 05:30:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:06,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430175462] [2024-11-09 05:30:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:06,480 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 [2024-11-09 05:30:06,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:06,481 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:06,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (10)] Waiting until timeout for monitored process [2024-11-09 05:30:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:06,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:30:06,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:06,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:06,646 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:06,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430175462] [2024-11-09 05:30:06,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430175462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:06,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:06,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:30:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523403359] [2024-11-09 05:30:06,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:06,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:30:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:30:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:30:06,648 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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) [2024-11-09 05:30:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:06,997 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-09 05:30:06,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:30:06,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 05:30:06,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:06,999 INFO L225 Difference]: With dead ends: 92 [2024-11-09 05:30:06,999 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 05:30:07,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:30:07,003 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:07,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 180 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:30:07,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 05:30:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 05:30:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-09 05:30:07,013 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 12 [2024-11-09 05:30:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:07,014 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-09 05:30:07,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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) [2024-11-09 05:30:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-09 05:30:07,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:30:07,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:07,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:07,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (10)] Ended with exit code 0 [2024-11-09 05:30:07,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:07,220 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:07,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:07,220 INFO L85 PathProgramCache]: Analyzing trace with hash 998826194, now seen corresponding path program 1 times [2024-11-09 05:30:07,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:07,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651354315] [2024-11-09 05:30:07,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:07,222 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 [2024-11-09 05:30:07,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:07,225 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:07,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:07,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 05:30:07,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:07,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:07,526 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:07,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651354315] [2024-11-09 05:30:07,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651354315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:07,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:30:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712460454] [2024-11-09 05:30:07,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:07,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:30:07,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:07,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:30:07,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:30:07,528 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:08,070 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-09 05:30:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:30:08,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 05:30:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:08,072 INFO L225 Difference]: With dead ends: 91 [2024-11-09 05:30:08,072 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 05:30:08,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:30:08,073 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 19 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:08,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 327 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:30:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 05:30:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 05:30:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 90 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-11-09 05:30:08,077 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 12 [2024-11-09 05:30:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:08,077 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-11-09 05:30:08,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-11-09 05:30:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:30:08,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:08,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:08,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:08,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:08,282 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:08,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:08,283 INFO L85 PathProgramCache]: Analyzing trace with hash 898840919, now seen corresponding path program 1 times [2024-11-09 05:30:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:08,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062457592] [2024-11-09 05:30:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:08,284 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 [2024-11-09 05:30:08,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:08,287 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:08,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 05:30:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:08,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:30:08,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:08,467 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 [2024-11-09 05:30:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:08,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:08,518 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:08,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062457592] [2024-11-09 05:30:08,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062457592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:08,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:08,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:30:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383054436] [2024-11-09 05:30:08,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:08,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:30:08,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:08,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:30:08,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:08,520 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:08,984 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-09 05:30:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:30:08,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 05:30:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:08,985 INFO L225 Difference]: With dead ends: 89 [2024-11-09 05:30:08,985 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 05:30:08,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:08,986 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:08,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:30:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 05:30:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 05:30:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 88 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-09 05:30:09,000 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 13 [2024-11-09 05:30:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:09,001 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-09 05:30:09,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-09 05:30:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:30:09,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:09,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:09,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:30:09,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:09,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:09,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash 898840920, now seen corresponding path program 1 times [2024-11-09 05:30:09,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:09,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603674528] [2024-11-09 05:30:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:09,209 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 [2024-11-09 05:30:09,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:09,212 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:09,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (13)] Waiting until timeout for monitored process [2024-11-09 05:30:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:09,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 05:30:09,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:09,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:30:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:09,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:09,485 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:09,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603674528] [2024-11-09 05:30:09,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603674528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:09,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:09,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:30:09,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766310780] [2024-11-09 05:30:09,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:09,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:30:09,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:09,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:30:09,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:09,488 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:09,979 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-09 05:30:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:30:09,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 05:30:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:09,980 INFO L225 Difference]: With dead ends: 87 [2024-11-09 05:30:09,981 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 05:30:09,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:09,981 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:09,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 225 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:30:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 05:30:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-09 05:30:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-09 05:30:09,985 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 13 [2024-11-09 05:30:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:09,986 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-09 05:30:09,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-09 05:30:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:30:09,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:09,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:09,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (13)] Ended with exit code 0 [2024-11-09 05:30:10,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:10,191 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:10,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1865592671, now seen corresponding path program 1 times [2024-11-09 05:30:10,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:10,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486722318] [2024-11-09 05:30:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:10,192 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 [2024-11-09 05:30:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:10,195 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:10,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:10,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:30:10,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:10,313 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 [2024-11-09 05:30:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:10,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:10,381 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:10,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486722318] [2024-11-09 05:30:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486722318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:10,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:10,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:30:10,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877594127] [2024-11-09 05:30:10,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:10,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:30:10,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:10,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:30:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:30:10,385 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:10,971 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2024-11-09 05:30:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:30:10,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-09 05:30:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:10,972 INFO L225 Difference]: With dead ends: 119 [2024-11-09 05:30:10,972 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 05:30:10,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:30:10,973 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 60 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:10,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:30:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 05:30:10,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2024-11-09 05:30:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 90 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-11-09 05:30:10,977 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 14 [2024-11-09 05:30:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:10,977 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-11-09 05:30:10,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-11-09 05:30:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:30:10,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:10,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:10,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:11,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:11,178 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:11,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:11,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1865592672, now seen corresponding path program 1 times [2024-11-09 05:30:11,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:11,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669966148] [2024-11-09 05:30:11,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:11,180 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 [2024-11-09 05:30:11,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:11,183 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:11,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:11,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 05:30:11,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:11,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:30:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:11,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:11,459 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669966148] [2024-11-09 05:30:11,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669966148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:11,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:11,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:30:11,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448229680] [2024-11-09 05:30:11,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:11,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:30:11,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:11,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:30:11,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:30:11,462 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:12,292 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2024-11-09 05:30:12,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:30:12,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-09 05:30:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:12,294 INFO L225 Difference]: With dead ends: 143 [2024-11-09 05:30:12,294 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 05:30:12,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:30:12,297 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 49 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:12,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 222 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 05:30:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 05:30:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 122. [2024-11-09 05:30:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.6989247311827957) internal successors, (158), 121 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 158 transitions. [2024-11-09 05:30:12,301 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 158 transitions. Word has length 14 [2024-11-09 05:30:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:12,301 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 158 transitions. [2024-11-09 05:30:12,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2024-11-09 05:30:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:30:12,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:12,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:12,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:12,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:12,503 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:12,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:12,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1998400823, now seen corresponding path program 1 times [2024-11-09 05:30:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961040866] [2024-11-09 05:30:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:12,504 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 [2024-11-09 05:30:12,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:12,505 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:12,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 05:30:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:12,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 05:30:12,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:12,638 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 [2024-11-09 05:30:12,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:30:12,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 05:30:12,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:12,882 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 24 treesize of output 10 [2024-11-09 05:30:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:12,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:12,942 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961040866] [2024-11-09 05:30:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961040866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:12,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:12,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:30:12,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376078183] [2024-11-09 05:30:12,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:12,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:30:12,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:12,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:30:12,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:30:12,945 INFO L87 Difference]: Start difference. First operand 122 states and 158 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:14,211 INFO L93 Difference]: Finished difference Result 129 states and 166 transitions. [2024-11-09 05:30:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:30:14,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:30:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:14,212 INFO L225 Difference]: With dead ends: 129 [2024-11-09 05:30:14,213 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 05:30:14,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:30:14,213 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 29 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:14,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 324 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 05:30:14,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 05:30:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2024-11-09 05:30:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 125 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2024-11-09 05:30:14,222 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 165 transitions. Word has length 15 [2024-11-09 05:30:14,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:14,222 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 165 transitions. [2024-11-09 05:30:14,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 165 transitions. [2024-11-09 05:30:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:30:14,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:14,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:14,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:30:14,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:14,424 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:14,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1998400824, now seen corresponding path program 1 times [2024-11-09 05:30:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542827916] [2024-11-09 05:30:14,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:14,425 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 [2024-11-09 05:30:14,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:14,428 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:14,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (17)] Waiting until timeout for monitored process [2024-11-09 05:30:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:14,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 05:30:14,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:14,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:30:14,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:30:14,605 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 19 treesize of output 18 [2024-11-09 05:30:14,618 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 19 treesize of output 18 [2024-11-09 05:30:14,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:14,887 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:30:14,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:14,894 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 05:30:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:14,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:14,980 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:14,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542827916] [2024-11-09 05:30:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542827916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:14,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:14,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 05:30:14,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792669828] [2024-11-09 05:30:14,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:14,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:30:14,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:14,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:30:14,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:30:14,982 INFO L87 Difference]: Start difference. First operand 126 states and 165 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:15,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:15,981 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2024-11-09 05:30:15,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:30:15,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:30:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:15,983 INFO L225 Difference]: With dead ends: 119 [2024-11-09 05:30:15,983 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 05:30:15,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:30:15,985 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:15,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 459 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 05:30:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 05:30:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-09 05:30:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 89 states have (on average 1.6853932584269662) internal successors, (150), 117 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions. [2024-11-09 05:30:15,990 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 15 [2024-11-09 05:30:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:15,990 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions. [2024-11-09 05:30:15,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2024-11-09 05:30:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:30:15,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:15,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:15,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (17)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:16,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:16,192 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:16,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash 497697018, now seen corresponding path program 1 times [2024-11-09 05:30:16,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:16,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291884908] [2024-11-09 05:30:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:16,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 [2024-11-09 05:30:16,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:16,195 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:16,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:16,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 05:30:16,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:16,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 05:30:16,477 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 13 treesize of output 9 [2024-11-09 05:30:16,565 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:30:16,565 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 [2024-11-09 05:30:16,611 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 18 treesize of output 13 [2024-11-09 05:30:16,664 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 19 treesize of output 7 [2024-11-09 05:30:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:16,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:16,739 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:16,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291884908] [2024-11-09 05:30:16,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291884908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:16,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:16,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:30:16,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035828113] [2024-11-09 05:30:16,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:16,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:30:16,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:16,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:30:16,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:30:16,741 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:17,674 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2024-11-09 05:30:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:30:17,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:30:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:17,675 INFO L225 Difference]: With dead ends: 126 [2024-11-09 05:30:17,676 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 05:30:17,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:30:17,677 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 29 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:17,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 315 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 05:30:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 05:30:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-09 05:30:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 97 states have (on average 1.6391752577319587) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:17,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 159 transitions. [2024-11-09 05:30:17,682 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 159 transitions. Word has length 15 [2024-11-09 05:30:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:17,683 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 159 transitions. [2024-11-09 05:30:17,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 159 transitions. [2024-11-09 05:30:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:30:17,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:17,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:17,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:17,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:17,885 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:17,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:17,885 INFO L85 PathProgramCache]: Analyzing trace with hash 497697019, now seen corresponding path program 1 times [2024-11-09 05:30:17,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:17,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482696275] [2024-11-09 05:30:17,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:17,886 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 [2024-11-09 05:30:17,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:17,890 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:17,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (19)] Waiting until timeout for monitored process [2024-11-09 05:30:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:18,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 05:30:18,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:18,233 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 [2024-11-09 05:30:18,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:30:18,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:30:18,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:30:18,469 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:30:18,469 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 13 [2024-11-09 05:30:18,510 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:30:18,511 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 [2024-11-09 05:30:18,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:30:18,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:30:18,746 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 15 treesize of output 7 [2024-11-09 05:30:18,761 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 7 treesize of output 3 [2024-11-09 05:30:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:18,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:18,850 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482696275] [2024-11-09 05:30:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482696275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:18,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:18,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:30:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879223847] [2024-11-09 05:30:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:18,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:30:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:18,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:30:18,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:30:18,853 INFO L87 Difference]: Start difference. First operand 126 states and 159 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:20,185 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2024-11-09 05:30:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:30:20,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 05:30:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:20,187 INFO L225 Difference]: With dead ends: 126 [2024-11-09 05:30:20,187 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 05:30:20,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 05:30:20,188 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 32 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:20,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 288 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 05:30:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 05:30:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-09 05:30:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 97 states have (on average 1.6288659793814433) internal successors, (158), 125 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2024-11-09 05:30:20,194 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 15 [2024-11-09 05:30:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:20,194 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2024-11-09 05:30:20,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2024-11-09 05:30:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:30:20,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:20,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:20,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (19)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:20,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:20,400 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:20,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:20,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1833196096, now seen corresponding path program 1 times [2024-11-09 05:30:20,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:20,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534732395] [2024-11-09 05:30:20,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:20,403 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 [2024-11-09 05:30:20,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:20,417 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:20,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 05:30:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:20,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 05:30:20,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:20,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 [2024-11-09 05:30:20,821 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 15 treesize of output 7 [2024-11-09 05:30:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:20,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:20,893 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:20,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534732395] [2024-11-09 05:30:20,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534732395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:20,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:20,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:30:20,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100797253] [2024-11-09 05:30:20,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:20,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:30:20,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:20,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:30:20,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:30:20,895 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:22,797 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2024-11-09 05:30:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:30:22,798 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 05:30:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:22,799 INFO L225 Difference]: With dead ends: 186 [2024-11-09 05:30:22,799 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 05:30:22,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-09 05:30:22,800 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 89 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:22,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 258 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 05:30:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 05:30:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 156. [2024-11-09 05:30:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 127 states have (on average 1.7244094488188977) internal successors, (219), 155 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 219 transitions. [2024-11-09 05:30:22,809 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 219 transitions. Word has length 16 [2024-11-09 05:30:22,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:22,809 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 219 transitions. [2024-11-09 05:30:22,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2024-11-09 05:30:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:30:22,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:22,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:22,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:30:23,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:23,016 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:23,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:23,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1833196097, now seen corresponding path program 1 times [2024-11-09 05:30:23,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:23,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224873551] [2024-11-09 05:30:23,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:23,018 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 [2024-11-09 05:30:23,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:23,022 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:23,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:23,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 05:30:23,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:23,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:30:23,596 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 15 treesize of output 7 [2024-11-09 05:30:23,601 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 7 treesize of output 3 [2024-11-09 05:30:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:23,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:23,675 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:23,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224873551] [2024-11-09 05:30:23,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224873551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:23,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:23,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:30:23,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189996886] [2024-11-09 05:30:23,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:23,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:30:23,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:23,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:30:23,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:30:23,677 INFO L87 Difference]: Start difference. First operand 156 states and 219 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:25,249 INFO L93 Difference]: Finished difference Result 168 states and 217 transitions. [2024-11-09 05:30:25,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:30:25,250 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 05:30:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:25,250 INFO L225 Difference]: With dead ends: 168 [2024-11-09 05:30:25,250 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 05:30:25,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:30:25,251 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 42 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:25,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 390 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 05:30:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 05:30:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2024-11-09 05:30:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 155 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 217 transitions. [2024-11-09 05:30:25,256 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 217 transitions. Word has length 16 [2024-11-09 05:30:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:25,256 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 217 transitions. [2024-11-09 05:30:25,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 217 transitions. [2024-11-09 05:30:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:30:25,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:25,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:25,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:25,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:25,458 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:25,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash 589867916, now seen corresponding path program 1 times [2024-11-09 05:30:25,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:25,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453546674] [2024-11-09 05:30:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:25,460 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 [2024-11-09 05:30:25,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:25,461 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:25,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:25,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 05:30:25,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:25,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:25,838 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:25,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453546674] [2024-11-09 05:30:25,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453546674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:25,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:25,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:30:25,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187599346] [2024-11-09 05:30:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:25,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:30:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:25,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:30:25,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:30:25,840 INFO L87 Difference]: Start difference. First operand 156 states and 217 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:26,081 INFO L93 Difference]: Finished difference Result 155 states and 215 transitions. [2024-11-09 05:30:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:30:26,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 05:30:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:26,082 INFO L225 Difference]: With dead ends: 155 [2024-11-09 05:30:26,083 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 05:30:26,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:30:26,083 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 116 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:26,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 258 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:30:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 05:30:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-09 05:30:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.6929133858267718) internal successors, (215), 154 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 215 transitions. [2024-11-09 05:30:26,088 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 215 transitions. Word has length 20 [2024-11-09 05:30:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:26,088 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 215 transitions. [2024-11-09 05:30:26,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 215 transitions. [2024-11-09 05:30:26,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:30:26,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:26,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:26,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:26,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:26,293 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:26,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash 589828261, now seen corresponding path program 1 times [2024-11-09 05:30:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:26,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394921494] [2024-11-09 05:30:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:26,294 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 [2024-11-09 05:30:26,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:26,295 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:26,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:26,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 05:30:26,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:26,760 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 15 treesize of output 7 [2024-11-09 05:30:26,769 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 7 treesize of output 3 [2024-11-09 05:30:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:26,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:26,873 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:26,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394921494] [2024-11-09 05:30:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394921494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:26,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:26,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 05:30:26,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760390423] [2024-11-09 05:30:26,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:26,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:30:26,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:26,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:30:26,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:30:26,875 INFO L87 Difference]: Start difference. First operand 155 states and 215 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:27,566 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2024-11-09 05:30:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:30:27,567 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 05:30:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:27,568 INFO L225 Difference]: With dead ends: 131 [2024-11-09 05:30:27,568 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 05:30:27,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:30:27,569 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 35 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:27,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 414 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:30:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 05:30:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2024-11-09 05:30:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.556701030927835) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2024-11-09 05:30:27,573 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 20 [2024-11-09 05:30:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:27,574 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2024-11-09 05:30:27,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2024-11-09 05:30:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 05:30:27,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:27,575 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:27,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:27,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:27,778 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:27,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:27,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1509722021, now seen corresponding path program 1 times [2024-11-09 05:30:27,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:27,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356796362] [2024-11-09 05:30:27,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:27,779 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 [2024-11-09 05:30:27,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:27,780 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:27,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:27,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 05:30:27,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:28,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:28,113 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:28,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356796362] [2024-11-09 05:30:28,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356796362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:28,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:28,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:30:28,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315787968] [2024-11-09 05:30:28,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:28,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:30:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:28,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:30:28,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:30:28,115 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:28,617 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2024-11-09 05:30:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:30:28,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 05:30:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:28,619 INFO L225 Difference]: With dead ends: 124 [2024-11-09 05:30:28,619 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 05:30:28,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:30:28,619 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 19 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:28,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 203 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:30:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 05:30:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 05:30:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.5463917525773196) internal successors, (150), 123 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2024-11-09 05:30:28,622 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 22 [2024-11-09 05:30:28,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:28,622 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2024-11-09 05:30:28,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2024-11-09 05:30:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 05:30:28,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:28,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:28,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:28,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:28,824 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2044044511, now seen corresponding path program 1 times [2024-11-09 05:30:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:28,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410786332] [2024-11-09 05:30:28,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:28,825 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 [2024-11-09 05:30:28,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:28,826 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:28,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:28,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 05:30:28,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:29,154 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~head#1.base_15| (_ BitVec 64))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~head#1.base_15| (_ bv0 1)) |c_#valid|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~head#1.base_15|) (_ bv0 1)))) is different from true [2024-11-09 05:30:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:29,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:29,166 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:29,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410786332] [2024-11-09 05:30:29,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410786332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:29,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:29,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:30:29,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806706162] [2024-11-09 05:30:29,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:29,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:30:29,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:29,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:30:29,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-09 05:30:29,169 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:29,744 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2024-11-09 05:30:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:30:29,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 05:30:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:29,745 INFO L225 Difference]: With dead ends: 131 [2024-11-09 05:30:29,745 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 05:30:29,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-09 05:30:29,745 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:29,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 103 Unchecked, 0.6s Time] [2024-11-09 05:30:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 05:30:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 05:30:29,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.5909090909090908) internal successors, (140), 114 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2024-11-09 05:30:29,749 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 23 [2024-11-09 05:30:29,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:29,749 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2024-11-09 05:30:29,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2024-11-09 05:30:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 05:30:29,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:29,750 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:29,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:29,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:29,951 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:29,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1937107699, now seen corresponding path program 1 times [2024-11-09 05:30:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:29,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408933524] [2024-11-09 05:30:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:29,952 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 [2024-11-09 05:30:29,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:29,953 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:29,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:30,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 05:30:30,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:30,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:30,391 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:30,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408933524] [2024-11-09 05:30:30,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408933524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:30,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:30,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:30:30,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024544524] [2024-11-09 05:30:30,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:30,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:30:30,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:30,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:30:30,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:30:30,393 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:31,011 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2024-11-09 05:30:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:30:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 05:30:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:31,012 INFO L225 Difference]: With dead ends: 113 [2024-11-09 05:30:31,012 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 05:30:31,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:30:31,013 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 59 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:31,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 168 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:30:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 05:30:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 05:30:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.5517241379310345) internal successors, (135), 111 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2024-11-09 05:30:31,016 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 26 [2024-11-09 05:30:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:31,016 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2024-11-09 05:30:31,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2024-11-09 05:30:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:30:31,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:31,017 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:31,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:31,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:31,218 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:31,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash 78806314, now seen corresponding path program 1 times [2024-11-09 05:30:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:31,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317412943] [2024-11-09 05:30:31,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:31,220 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 [2024-11-09 05:30:31,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:31,223 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:31,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:30:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:31,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 05:30:31,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:31,571 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 [2024-11-09 05:30:31,588 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 13 treesize of output 9 [2024-11-09 05:30:31,603 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 13 treesize of output 9 [2024-11-09 05:30:31,717 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:30:31,717 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 19 treesize of output 27 [2024-11-09 05:30:31,807 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 18 treesize of output 13 [2024-11-09 05:30:31,824 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 18 treesize of output 13 [2024-11-09 05:30:31,978 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 19 treesize of output 7 [2024-11-09 05:30:31,988 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 19 treesize of output 7 [2024-11-09 05:30:32,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:30:32,411 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 15 [2024-11-09 05:30:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:32,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:32,836 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 32 [2024-11-09 05:30:37,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:37,282 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 22 treesize of output 23 [2024-11-09 05:30:37,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 05:30:37,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:37,316 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 22 treesize of output 23 [2024-11-09 05:30:37,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 05:30:37,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:30:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:42,263 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:42,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317412943] [2024-11-09 05:30:42,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317412943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:30:42,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1708183392] [2024-11-09 05:30:42,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:42,264 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:30:42,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:30:42,266 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:30:42,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-09 05:30:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:42,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 05:30:42,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:43,002 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 [2024-11-09 05:30:43,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:30:43,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:30:43,240 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:30:43,240 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 19 treesize of output 27 [2024-11-09 05:30:43,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:30:43,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:30:43,582 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:30:43,596 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:30:43,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:30:44,284 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 15 [2024-11-09 05:30:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:44,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:44,390 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 32 [2024-11-09 05:30:44,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)) (.cse1 (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~ptr~0#1.base|))))) (and (or (forall ((v_arrayElimCell_37 (_ BitVec 64))) (= (_ bv0 1) (bvadd (select |c_#valid| v_arrayElimCell_37) (_ bv1 1)))) (and (forall ((v_ArrVal_756 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_756) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.base|)) (forall ((v_ArrVal_755 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|)) .cse1)) (or (forall ((v_ArrVal_756 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_756) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.base|))) (forall ((v_ArrVal_755 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_755) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|))) .cse1))) is different from false [2024-11-09 05:30:48,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:48,803 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 22 treesize of output 23 [2024-11-09 05:30:48,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 36 treesize of output 24 [2024-11-09 05:30:48,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:30:48,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:48,841 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 22 treesize of output 23 [2024-11-09 05:30:48,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 05:30:48,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:30:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:48,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1708183392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:30:48,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293157674] [2024-11-09 05:30:48,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:48,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:30:48,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:30:48,880 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:30:48,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-09 05:30:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:49,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 05:30:49,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:49,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:30:49,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:30:49,255 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:30:49,255 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 [2024-11-09 05:30:49,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 16 treesize of output 11 [2024-11-09 05:30:49,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:30:49,538 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:30:49,554 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:30:49,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:30:50,306 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 15 [2024-11-09 05:30:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:50,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:50,388 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 32 [2024-11-09 05:30:50,511 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-09 05:30:50,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 05:30:50,909 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_816 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_816) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.base|)) (forall ((v_ArrVal_817 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|)))) is different from false [2024-11-09 05:30:50,950 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_26| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_26|))) (forall ((v_ArrVal_817 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_26| v_ArrVal_817) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_26| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_26|))) (forall ((v_ArrVal_816 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_26| v_ArrVal_816) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.base|)))))) is different from false [2024-11-09 05:30:51,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:30:51,024 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 22 treesize of output 23 [2024-11-09 05:30:51,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 05:30:51,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:30:51,045 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 05:30:51,045 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 22 treesize of output 1 [2024-11-09 05:30:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 05:30:51,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293157674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:30:51,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 05:30:51,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 13, 14, 14] total 49 [2024-11-09 05:30:51,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988957923] [2024-11-09 05:30:51,050 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 05:30:51,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 05:30:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:51,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 05:30:51,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1941, Unknown=20, NotChecked=276, Total=2450 [2024-11-09 05:30:51,053 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:56,474 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2024-11-09 05:30:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 05:30:56,475 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 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 27 [2024-11-09 05:30:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:56,475 INFO L225 Difference]: With dead ends: 132 [2024-11-09 05:30:56,476 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 05:30:56,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=343, Invalid=2727, Unknown=22, NotChecked=330, Total=3422 [2024-11-09 05:30:56,477 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 88 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:56,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1081 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1126 Invalid, 0 Unknown, 229 Unchecked, 4.2s Time] [2024-11-09 05:30:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 05:30:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2024-11-09 05:30:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 99 states have (on average 1.5252525252525253) internal successors, (151), 123 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2024-11-09 05:30:56,482 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 27 [2024-11-09 05:30:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:56,482 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2024-11-09 05:30:56,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.163265306122449) internal successors, (106), 50 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2024-11-09 05:30:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:30:56,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:56,483 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:56,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-09 05:30:56,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:56,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:57,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:30:57,091 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:30:57,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash 78806315, now seen corresponding path program 1 times [2024-11-09 05:30:57,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:57,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109517662] [2024-11-09 05:30:57,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:57,092 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 [2024-11-09 05:30:57,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:57,093 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:30:57,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (30)] Waiting until timeout for monitored process [2024-11-09 05:30:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:57,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 05:30:57,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:57,386 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 [2024-11-09 05:30:57,401 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 13 treesize of output 9 [2024-11-09 05:30:57,409 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 13 treesize of output 9 [2024-11-09 05:30:57,483 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:30:57,483 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 [2024-11-09 05:30:57,493 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 6 treesize of output 5 [2024-11-09 05:30:57,539 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 18 treesize of output 13 [2024-11-09 05:30:57,557 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 18 treesize of output 13 [2024-11-09 05:30:57,675 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 19 treesize of output 7 [2024-11-09 05:30:57,686 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 19 treesize of output 7 [2024-11-09 05:30:57,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:30:57,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:30:58,136 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 25 treesize of output 13 [2024-11-09 05:30:58,147 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 7 treesize of output 3 [2024-11-09 05:30:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:30:58,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:59,357 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 60 treesize of output 56 [2024-11-09 05:30:59,361 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 90 treesize of output 82 [2024-11-09 05:30:59,463 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 28 [2024-11-09 05:31:00,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~ptr~0#1.offset|)) (.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_878 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_create_~ptr~0#1.base|)) (bvule |c_ULTIMATE.start_create_~ptr~0#1.offset| .cse1) (forall ((v_ArrVal_879 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|)))) is different from false [2024-11-09 05:31:03,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:31:03,219 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 22 treesize of output 23 [2024-11-09 05:31:03,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 05:31:03,241 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 05:31:03,241 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 22 treesize of output 1 [2024-11-09 05:31:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:31:03,250 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:31:03,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109517662] [2024-11-09 05:31:03,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109517662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:03,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1286913853] [2024-11-09 05:31:03,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:03,250 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:31:03,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:31:03,253 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:31:03,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-09 05:31:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:03,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 05:31:03,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:03,935 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 [2024-11-09 05:31:04,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:04,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:04,271 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:31:04,271 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 [2024-11-09 05:31:04,289 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 6 treesize of output 5 [2024-11-09 05:31:04,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:04,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:04,742 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:31:04,761 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:31:05,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:31:05,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:05,898 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 25 treesize of output 13 [2024-11-09 05:31:05,910 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 7 treesize of output 3 [2024-11-09 05:31:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:31:05,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:06,104 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 60 treesize of output 56 [2024-11-09 05:31:06,108 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 90 treesize of output 82 [2024-11-09 05:31:06,195 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 28 [2024-11-09 05:31:06,428 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)) (.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~ptr~0#1.offset|))) (and (forall ((v_ArrVal_942 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|)) (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_create_~ptr~0#1.base|)) (forall ((v_ArrVal_943 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_943) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (bvule |c_ULTIMATE.start_create_~ptr~0#1.offset| .cse1))) is different from false [2024-11-09 05:31:08,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:31:08,778 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 22 treesize of output 23 [2024-11-09 05:31:08,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 05:31:08,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:31:08,804 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 05:31:08,804 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 22 treesize of output 1 [2024-11-09 05:31:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:31:08,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1286913853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:08,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182687666] [2024-11-09 05:31:08,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:08,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:31:08,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:31:08,816 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:31:08,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-09 05:31:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:09,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 05:31:09,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:09,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:09,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:09,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:31:09,345 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:31:09,345 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 [2024-11-09 05:31:09,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:09,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:09,478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:31:09,493 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:31:09,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:31:09,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:09,750 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 25 treesize of output 13 [2024-11-09 05:31:09,759 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 7 treesize of output 3 [2024-11-09 05:31:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:31:09,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:09,927 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 60 treesize of output 56 [2024-11-09 05:31:09,931 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 90 treesize of output 82 [2024-11-09 05:31:10,017 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 28 [2024-11-09 05:31:10,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~ptr~0#1.offset|)) (.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1006 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1006) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|)) (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_create_~ptr~0#1.base|)) (bvule |c_ULTIMATE.start_create_~ptr~0#1.offset| .cse1) (forall ((v_ArrVal_1007 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1007) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))))) is different from false [2024-11-09 05:31:10,352 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_40| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_40|))) (forall ((v_ArrVal_1007 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_40| v_ArrVal_1007) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_40| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_40|))) (forall ((v_ArrVal_1006 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_40| v_ArrVal_1006) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|)))))) is different from false [2024-11-09 05:31:10,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:31:10,420 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 22 treesize of output 23 [2024-11-09 05:31:10,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 05:31:10,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:31:10,444 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 05:31:10,445 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 22 treesize of output 1 [2024-11-09 05:31:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 05:31:10,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182687666] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:10,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 05:31:10,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 13, 13, 13] total 36 [2024-11-09 05:31:10,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411004547] [2024-11-09 05:31:10,451 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 05:31:10,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 05:31:10,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:31:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 05:31:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=959, Unknown=5, NotChecked=260, Total=1332 [2024-11-09 05:31:10,453 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand has 37 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:31:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:31:17,535 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2024-11-09 05:31:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 05:31:17,536 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 05:31:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:31:17,537 INFO L225 Difference]: With dead ends: 132 [2024-11-09 05:31:17,537 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 05:31:17,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=204, Invalid=1613, Unknown=5, NotChecked=340, Total=2162 [2024-11-09 05:31:17,538 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 61 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:31:17,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1078 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 943 Invalid, 0 Unknown, 304 Unchecked, 5.4s Time] [2024-11-09 05:31:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 05:31:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2024-11-09 05:31:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 99 states have (on average 1.5151515151515151) internal successors, (150), 123 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:31:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2024-11-09 05:31:17,542 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 27 [2024-11-09 05:31:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:31:17,542 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2024-11-09 05:31:17,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:31:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2024-11-09 05:31:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:31:17,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:31:17,543 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:31:17,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-09 05:31:17,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-11-09 05:31:17,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (30)] Forceful destruction successful, exit code 0 [2024-11-09 05:31:18,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:31:18,148 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:31:18,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:31:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1421897491, now seen corresponding path program 1 times [2024-11-09 05:31:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:31:18,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141086037] [2024-11-09 05:31:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:18,149 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 [2024-11-09 05:31:18,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:31:18,150 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:31:18,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (33)] Waiting until timeout for monitored process [2024-11-09 05:31:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:18,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 05:31:18,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:18,593 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 [2024-11-09 05:31:18,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:18,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:18,724 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:31:18,724 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 19 treesize of output 27 [2024-11-09 05:31:18,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:18,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:18,933 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:31:19,153 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 26 treesize of output 14 [2024-11-09 05:31:19,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:19,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:19,358 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 35 treesize of output 26 [2024-11-09 05:31:19,568 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-09 05:31:19,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 05:31:19,700 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 47 treesize of output 34 [2024-11-09 05:31:19,815 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-09 05:31:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:31:19,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:23,474 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1112 (_ BitVec 1)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_43| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1112) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~next#1.offset|) |c_ULTIMATE.start___list_add_~new#1.base|)) |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1110))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))))) is different from false [2024-11-09 05:31:23,553 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1112 (_ BitVec 1)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_43| (_ BitVec 64))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1112) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|) |c_ULTIMATE.start_list_add_tail_~new#1.base|)) |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1110))) (store .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43|))))) is different from false [2024-11-09 05:31:27,035 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:31:27,242 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 05:31:27,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1308 treesize of output 1029 [2024-11-09 05:31:27,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:31:27,296 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 237 treesize of output 208 [2024-11-09 05:31:27,324 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 352 treesize of output 322 [2024-11-09 05:31:27,352 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 149 treesize of output 141 [2024-11-09 05:31:27,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 272 [2024-11-09 05:31:27,524 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 05:31:27,524 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 489 treesize of output 479 [2024-11-09 05:31:27,577 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 222 treesize of output 186 [2024-11-09 05:31:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 05:31:29,995 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:31:29,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141086037] [2024-11-09 05:31:29,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141086037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:29,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [932347105] [2024-11-09 05:31:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:29,996 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:31:29,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:31:29,998 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:31:30,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-09 05:31:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:31,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 05:31:31,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:31,164 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 [2024-11-09 05:31:31,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:31,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:31,283 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:31:31,284 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 19 treesize of output 27 [2024-11-09 05:31:31,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:31,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:31,434 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:31:31,612 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 26 treesize of output 14 [2024-11-09 05:31:31,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:31,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:31,779 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 35 treesize of output 26 [2024-11-09 05:31:32,062 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-09 05:31:32,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 05:31:32,117 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 47 treesize of output 34 [2024-11-09 05:31:32,206 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-09 05:31:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:31:32,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:32,673 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (_ BitVec 1)) (|v_ULTIMATE.start_create_~ptr~0#1.base_48| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_48|))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_48| v_ArrVal_1215) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_48| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)))) (_ bv0 1)))) is different from false [2024-11-09 05:31:44,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:31:44,545 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 05:31:44,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 2212 treesize of output 1671 [2024-11-09 05:31:44,693 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 05:31:44,693 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 647 treesize of output 635 [2024-11-09 05:31:44,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:31:44,735 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 241 treesize of output 221 [2024-11-09 05:31:44,753 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 324 treesize of output 300 [2024-11-09 05:31:44,772 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 180 treesize of output 172 [2024-11-09 05:31:44,786 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 196 treesize of output 184 [2024-11-09 05:31:44,801 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 222 treesize of output 186 [2024-11-09 05:31:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 05:31:45,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [932347105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:45,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243744116] [2024-11-09 05:31:45,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:45,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:31:45,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:31:45,396 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:31:45,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-09 05:31:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:45,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 05:31:45,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:45,655 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 [2024-11-09 05:31:45,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:45,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:31:45,779 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:31:45,780 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 [2024-11-09 05:31:45,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:45,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:46,189 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:31:46,644 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 26 treesize of output 14 [2024-11-09 05:31:46,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:46,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:31:46,949 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 35 treesize of output 26 [2024-11-09 05:31:47,151 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-09 05:31:47,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 05:31:47,218 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 47 treesize of output 34 [2024-11-09 05:31:47,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2024-11-09 05:31:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:31:48,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:55,657 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_53| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_53|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_53| (_ bv1 1)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~prev#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|)) |v_ULTIMATE.start_create_~ptr~0#1.base_53| v_ArrVal_1318) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))))) is different from false [2024-11-09 05:31:55,702 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_53| (_ BitVec 64))) (or (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_53| (_ bv1 1)) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1315))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_53| v_ArrVal_1318) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)))) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_53|))))) is different from false [2024-11-09 05:31:58,058 INFO L349 Elim1Store]: treesize reduction 109, result has 55.3 percent of original size [2024-11-09 05:31:58,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 286 [2024-11-09 05:32:01,276 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1315 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1311 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1310 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_53| (_ BitVec 64))) (let ((.cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1310) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (or (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store v_ArrVal_1311 .cse3 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1315)) (.cse1 (select v_ArrVal_1311 .cse3))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_create_~ptr~0#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_53| v_ArrVal_1318) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_53|) (= |c_ULTIMATE.start_create_~ptr~0#1.base| (select (select (store (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1311) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse6 .cse3 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1315)) (.cse5 (select .cse6 .cse3))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse2 |c_ULTIMATE.start_create_~ptr~0#1.base|)))) |v_ULTIMATE.start_create_~ptr~0#1.base_53| v_ArrVal_1318) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_53|))))) is different from false [2024-11-09 05:32:14,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:32:15,204 INFO L349 Elim1Store]: treesize reduction 73, result has 34.8 percent of original size [2024-11-09 05:32:15,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 2389 treesize of output 2054 [2024-11-09 05:32:15,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:32:15,260 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 370 treesize of output 300 [2024-11-09 05:32:15,294 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 498 treesize of output 444 [2024-11-09 05:32:15,346 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 191 treesize of output 175 [2024-11-09 05:32:15,364 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 332 treesize of output 300 [2024-11-09 05:32:15,496 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 05:32:15,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 322 treesize of output 314 [2024-11-09 05:32:15,523 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 262 treesize of output 202 [2024-11-09 05:32:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 05:32:18,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243744116] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:32:18,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 05:32:18,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 13, 16, 15, 17] total 53 [2024-11-09 05:32:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755283322] [2024-11-09 05:32:18,140 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 05:32:18,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-09 05:32:18,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:32:18,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-09 05:32:18,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1807, Unknown=168, NotChecked=582, Total=2862 [2024-11-09 05:32:18,143 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:32:30,175 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 [0, 1] [2024-11-09 05:32:31,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:32:34,124 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 [0, 1] [2024-11-09 05:33:41,257 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, 1] [2024-11-09 05:33:43,270 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, 1] [2024-11-09 05:33:45,276 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, 1] [2024-11-09 05:33:46,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:33:49,343 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, 1] [2024-11-09 05:33:53,663 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, 1] [2024-11-09 05:33:56,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:33:59,486 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, 1] [2024-11-09 05:34:01,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:34:03,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:34:05,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:34:07,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:34:09,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:34:10,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:34:12,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 [0, 1] [2024-11-09 05:34:18,687 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, 1] [2024-11-09 05:34:22,127 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 [0, 1] [2024-11-09 05:34:23,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start___list_add_~prev#1.base|))) (= (_ bv0 64) |c_ULTIMATE.start_create_~head~0#1.offset|) (forall ((v_ArrVal_1112 (_ BitVec 1)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_43| (_ BitVec 64))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1112) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1110))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43|))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|))) (forall ((v_ArrVal_1112 (_ BitVec 1)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_43| (_ BitVec 64))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1112) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~prev#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|)) |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43|))))) (exists ((|ULTIMATE.start___list_add_~next#1.base| (_ BitVec 64)) (|ULTIMATE.start_create_~ptr~0#1.base| (_ BitVec 64))) (and (not (= |c_ULTIMATE.start___list_add_~prev#1.base| |ULTIMATE.start___list_add_~next#1.base|)) (not (= |ULTIMATE.start_create_~ptr~0#1.base| |c_ULTIMATE.start___list_add_~prev#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |ULTIMATE.start_create_~ptr~0#1.base|))) (not (= |ULTIMATE.start_create_~ptr~0#1.base| |ULTIMATE.start___list_add_~next#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |ULTIMATE.start___list_add_~next#1.base|))))) (forall ((v_ArrVal_1112 (_ BitVec 1)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_43| (_ BitVec 64))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1112) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43|))))))) is different from false [2024-11-09 05:34:33,231 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 [0, 1] [2024-11-09 05:34:34,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:34:35,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:34:38,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:34:48,152 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 [0, 1] [2024-11-09 05:34:50,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 05:34:50,663 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (_ BitVec 1)) (|v_ULTIMATE.start_create_~ptr~0#1.base_48| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_48|))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_48| v_ArrVal_1215) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_48| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (_ bv0 1)))) (forall ((v_ArrVal_1112 (_ BitVec 1)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_43| (_ BitVec 64))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1112) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43|))))))) is different from false [2024-11-09 05:34:50,759 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1315 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1311 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1310 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_53| (_ BitVec 64))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1310) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (or (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store v_ArrVal_1311 .cse3 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1315)) (.cse1 (select v_ArrVal_1311 .cse3))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_create_~ptr~0#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_53| v_ArrVal_1318) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_53|) (= |c_ULTIMATE.start_create_~ptr~0#1.base| (select (select (store (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1311) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse6 .cse3 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1315)) (.cse5 (select .cse6 .cse3))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse2 |c_ULTIMATE.start_create_~ptr~0#1.base|)))) |v_ULTIMATE.start_create_~ptr~0#1.base_53| v_ArrVal_1318) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_53|)))) (or (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((v_ArrVal_1106 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (_ BitVec 1)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1105 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_43| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1112) (select (select (store (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse9 .cse3 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1110)) (.cse8 (select .cse9 .cse3))) (store .cse7 .cse8 (store (select .cse7 .cse8) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1105) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_create_~ptr~0#1.base|)))) |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))))))) (forall ((v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))))))) is different from false [2024-11-09 05:34:54,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|)) (.cse8 (bvadd (_ bv8 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|))) (let ((.cse0 (select .cse7 .cse8)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_tail_~head#1.base|) .cse8)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store .cse7 .cse8 |c_ULTIMATE.start_list_add_tail_~new#1.base|))) (.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse0))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))) (or (forall ((v_ArrVal_1112 (_ BitVec 1)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_43| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1112) (select (select (store (let ((.cse2 (store .cse4 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1110))) (store .cse2 .cse0 (store (select .cse2 .cse0) .cse3 |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_list_add_tail_~head#1.base|) (_ bv1 1))))) (forall ((v_ArrVal_1315 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_53| (_ BitVec 64))) (let ((.cse5 (select (select (store (let ((.cse6 (store .cse4 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1315))) (store .cse6 .cse0 (store (select .cse6 .cse0) .cse3 |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_53| v_ArrVal_1318) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_list_add_tail_~head#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_53|) (= |c_ULTIMATE.start_list_add_tail_~new#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_53|) (= .cse5 |c_ULTIMATE.start_list_add_tail_~new#1.base|) (= .cse5 |v_ULTIMATE.start_create_~ptr~0#1.base_53|) (= .cse5 |c_ULTIMATE.start_list_add_tail_~head#1.base|))))))) is different from false [2024-11-09 05:35:00,363 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 [1] [2024-11-09 05:35:01,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~next#1.offset|) |c_ULTIMATE.start___list_add_~new#1.base|))) (.cse2 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start___list_add_~prev#1.base|))) (or (forall ((v_ArrVal_1315 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_53| (_ BitVec 64))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_53| (_ bv1 1)) (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1315))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_53| v_ArrVal_1318) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_53|))))) (not (= (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start___list_add_~new#1.base|)) (_ bv0 1)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_55| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_55|))) (forall ((v_ArrVal_1315 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1311 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1310 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_53| (_ BitVec 64))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_55| v_ArrVal_1310) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (or (= (select (select (store (let ((.cse6 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_55| v_ArrVal_1311) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse6 .cse2 |v_ULTIMATE.start_create_~ptr~0#1.base_55|)) |v_ULTIMATE.start_create_~ptr~0#1.base_55| v_ArrVal_1315)) (.cse4 (select .cse6 .cse2))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 |v_ULTIMATE.start_create_~ptr~0#1.base_55|)))) |v_ULTIMATE.start_create_~ptr~0#1.base_53| v_ArrVal_1318) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2) |v_ULTIMATE.start_create_~ptr~0#1.base_55|) (= (select (select (store (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store v_ArrVal_1311 .cse2 |v_ULTIMATE.start_create_~ptr~0#1.base_55|)) |v_ULTIMATE.start_create_~ptr~0#1.base_55| v_ArrVal_1315)) (.cse8 (select v_ArrVal_1311 .cse2))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse5 |v_ULTIMATE.start_create_~ptr~0#1.base_55|))) |v_ULTIMATE.start_create_~ptr~0#1.base_53| v_ArrVal_1318) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2) |v_ULTIMATE.start_create_~ptr~0#1.base_53|) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_53|)))))) (forall ((v_ArrVal_1112 (_ BitVec 1)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_43| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1112) (select (select (store (let ((.cse9 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1110))) (store .cse9 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse9 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1106 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (_ BitVec 1)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1105 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_45| (_ BitVec 64)) (|v_ULTIMATE.start_create_~ptr~0#1.base_43| (_ BitVec 64))) (let ((.cse10 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_45| (_ bv1 1)))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse10 |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1112) (select (select (store (let ((.cse13 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_45| v_ArrVal_1106) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse13 .cse2 |v_ULTIMATE.start_create_~ptr~0#1.base_45|)) |v_ULTIMATE.start_create_~ptr~0#1.base_45| v_ArrVal_1110)) (.cse12 (select .cse13 .cse2))) (store .cse11 .cse12 (store (select .cse11 .cse12) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_45| v_ArrVal_1105) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2) |v_ULTIMATE.start_create_~ptr~0#1.base_45|)))) |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select .cse10 |v_ULTIMATE.start_create_~ptr~0#1.base_43|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse10 |c_ULTIMATE.start_create_~head~0#1.base|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_45|)))))))) is different from false [2024-11-09 05:35:04,619 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start___list_add_~prev#1.base|))) (forall ((v_ArrVal_1112 (_ BitVec 1)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1110 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_43| (_ BitVec 64))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1112) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1110))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_43| v_ArrVal_1113) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_43|)))))) is different from false [2024-11-09 05:35:12,428 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 [0, 1] [2024-11-09 05:35:20,088 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 [1] [2024-11-09 05:35:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:25,164 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2024-11-09 05:35:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 05:35:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 05:35:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:25,167 INFO L225 Difference]: With dead ends: 131 [2024-11-09 05:35:25,167 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 05:35:25,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 99 SyntacticMatches, 13 SemanticMatches, 70 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 144.6s TimeCoverageRelationStatistics Valid=511, Invalid=2809, Unknown=268, NotChecked=1524, Total=5112 [2024-11-09 05:35:25,168 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 10 mSolverCounterUnsat, 79 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 88.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 79 IncrementalHoareTripleChecker+Unknown, 785 IncrementalHoareTripleChecker+Unchecked, 90.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:25,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1174 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 964 Invalid, 79 Unknown, 785 Unchecked, 90.7s Time] [2024-11-09 05:35:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 05:35:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2024-11-09 05:35:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.505050505050505) internal successors, (149), 122 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2024-11-09 05:35:25,172 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 27 [2024-11-09 05:35:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:25,172 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2024-11-09 05:35:25,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:35:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2024-11-09 05:35:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:35:25,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:25,174 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:25,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-11-09 05:35:25,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (33)] Forceful destruction successful, exit code 0 [2024-11-09 05:35:25,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2024-11-09 05:35:25,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:35:25,775 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-09 05:35:25,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:25,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1421897490, now seen corresponding path program 1 times [2024-11-09 05:35:25,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:35:25,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041087739] [2024-11-09 05:35:25,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:25,776 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 [2024-11-09 05:35:25,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:35:25,777 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:35:25,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/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 (36)] Waiting until timeout for monitored process [2024-11-09 05:35:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:26,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-09 05:35:26,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:26,310 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 [2024-11-09 05:35:26,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:35:26,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:35:26,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:35:26,704 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:35:26,704 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 19 treesize of output 27 [2024-11-09 05:35:26,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:35:26,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:35:28,031 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 19 treesize of output 11 [2024-11-09 05:35:28,062 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 26 treesize of output 14 [2024-11-09 05:35:28,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:35:28,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:35:28,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:35:28,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:35:28,617 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 44 treesize of output 31 [2024-11-09 05:35:28,687 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 11 [2024-11-09 05:35:29,175 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 05:35:29,175 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 24 treesize of output 26 [2024-11-09 05:35:29,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:35:29,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:35:29,460 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 45 treesize of output 32 [2024-11-09 05:35:29,801 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 05:35:29,813 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 7 treesize of output 3 [2024-11-09 05:35:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:35:30,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:45,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~next#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~next#1.base|) .cse4 |c_ULTIMATE.start___list_add_~new#1.offset|))) (.cse2 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1423))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base|) .cse4 |c_ULTIMATE.start___list_add_~new#1.base|)) |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1422))) (store .cse3 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse3 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (let ((.cse6 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1423))) (store .cse6 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse6 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv8 64) .cse5)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))))) is different from false [2024-11-09 05:35:46,593 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_tail_~head#1.base|) .cse4 |c_ULTIMATE.start_list_add_tail_~new#1.offset|))) (.cse2 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1423))) (store .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|) .cse4 |c_ULTIMATE.start_list_add_tail_~new#1.base|)) |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1422))) (store .cse3 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse3 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (forall ((v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (let ((.cse6 (store .cse1 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1423))) (store .cse6 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse6 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (bvule .cse5 (bvadd .cse5 (_ bv8 64))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))))) is different from false [2024-11-09 05:36:06,447 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 2115 treesize of output 1959 [2024-11-09 05:36:13,969 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse0 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1415 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1414 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1425 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1414) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse2 (select .cse5 .cse3))) (or (= (bvadd (_ bv8 64) (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_ArrVal_1415 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1423))) (store .cse1 .cse2 (store (select .cse1 .cse2) (select v_ArrVal_1415 .cse3) v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (_ bv0 64)) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (select (store (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse5 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_60|)) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1422))) (store .cse4 .cse2 (store (select .cse4 .cse2) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1415) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse6 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse6 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1415 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1414 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1425 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse10 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1414) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse8 (select .cse10 .cse3))) (or (= (bvadd (_ bv8 64) (select (select (store (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_ArrVal_1415 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1423))) (store .cse7 .cse8 (store (select .cse7 .cse8) (select v_ArrVal_1415 .cse3) v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (_ bv0 64)) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse10 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_60|)) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1422))) (store .cse9 .cse8 (store (select .cse9 .cse8) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1415) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_60|)))))) (not (= (_ bv0 1) (select .cse6 |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse11 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse11 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((v_prenex_4 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_prenex_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_6 (Array (_ BitVec 64) (_ BitVec 64)))) (or (let ((.cse12 (select (select (store (let ((.cse15 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_prenex_1) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse15 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_prenex_3)) (.cse14 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_prenex_2) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (store .cse13 .cse14 (store (select .cse13 .cse14) (select .cse15 .cse3) v_prenex_5)))) v_prenex_4 v_prenex_6) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse12 (bvadd .cse12 (_ bv8 64)))) (not (= (_ bv0 1) (select .cse11 v_prenex_4)))))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse16 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse16 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1415 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1414 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1425 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store (let ((.cse19 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1415) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse17 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse19 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1423)) (.cse18 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1414) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (store .cse17 .cse18 (store (select .cse17 .cse18) (select .cse19 .cse3) v_ArrVal_1425)))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) (_ bv8 64)) (_ bv20 64))) (not (= (_ bv0 1) (select .cse16 |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))))))) is different from true [2024-11-09 05:36:16,684 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:36:17,178 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 05:36:17,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2288 treesize of output 1967 [2024-11-09 05:36:17,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:17,339 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 452 treesize of output 444 [2024-11-09 05:36:17,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:17,394 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 320 treesize of output 240 [2024-11-09 05:36:17,425 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 177 treesize of output 165 [2024-11-09 05:36:17,482 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 352 treesize of output 292 [2024-11-09 05:36:17,522 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 171 treesize of output 135 [2024-11-09 05:36:17,550 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 108 treesize of output 96 [2024-11-09 05:36:18,019 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:36:18,603 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 05:36:18,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1808 treesize of output 1407 [2024-11-09 05:36:18,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:18,994 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 472 treesize of output 452 [2024-11-09 05:36:19,050 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 151 treesize of output 135 [2024-11-09 05:36:19,079 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 251 treesize of output 219 [2024-11-09 05:36:19,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:19,148 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 306 treesize of output 226 [2024-11-09 05:36:19,192 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 352 treesize of output 292 [2024-11-09 05:36:19,228 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 175 treesize of output 139 [2024-11-09 05:36:19,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:36:20,157 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 05:36:20,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1538 treesize of output 1531 [2024-11-09 05:36:20,216 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:36:20,661 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 05:36:20,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1798 treesize of output 1327 [2024-11-09 05:36:20,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:20,828 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 397 treesize of output 393 [2024-11-09 05:36:21,154 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 05:36:21,155 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 797 treesize of output 769 [2024-11-09 05:36:21,222 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 277 treesize of output 257 [2024-11-09 05:36:21,334 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 142 treesize of output 130 [2024-11-09 05:36:21,362 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 353 treesize of output 281 [2024-11-09 05:36:21,423 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 122 treesize of output 110 [2024-11-09 05:36:22,101 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:36:23,114 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 05:36:23,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1537 treesize of output 1530 [2024-11-09 05:36:23,161 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:36:23,622 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 05:36:23,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1571 treesize of output 1140 [2024-11-09 05:36:23,735 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 242 treesize of output 226 [2024-11-09 05:36:24,074 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 05:36:24,074 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 870 treesize of output 840 [2024-11-09 05:36:24,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:24,328 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 223 treesize of output 221 [2024-11-09 05:36:24,399 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 227 treesize of output 203 [2024-11-09 05:36:24,435 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 325 treesize of output 253 [2024-11-09 05:36:24,512 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 70 treesize of output 58 [2024-11-09 05:36:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 05:36:28,122 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:36:28,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041087739] [2024-11-09 05:36:28,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041087739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:36:28,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [761502258] [2024-11-09 05:36:28,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:28,122 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:36:28,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:36:28,124 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:36:28,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-09 05:36:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:29,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-09 05:36:29,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:36:29,879 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 [2024-11-09 05:36:29,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:36:30,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:36:30,439 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:36:30,439 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 19 treesize of output 27 [2024-11-09 05:36:30,516 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 6 treesize of output 5 [2024-11-09 05:36:30,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:36:30,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:36:31,577 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 19 treesize of output 11 [2024-11-09 05:36:31,713 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 26 treesize of output 14 [2024-11-09 05:36:31,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:36:31,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:36:32,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:36:32,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:36:32,383 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 11 [2024-11-09 05:36:32,418 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 44 treesize of output 31 [2024-11-09 05:36:33,371 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 05:36:33,372 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 24 treesize of output 26 [2024-11-09 05:36:33,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:36:33,590 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 45 treesize of output 32 [2024-11-09 05:36:33,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:36:33,806 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 7 treesize of output 3 [2024-11-09 05:36:33,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:36:33,842 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 05:36:34,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:36:34,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:36:36,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1538 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1538) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv8 64) .cse1)))))))) is different from false [2024-11-09 05:37:18,485 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 2155 treesize of output 1999 [2024-11-09 05:38:02,924 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:38:03,530 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 05:38:03,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3904 treesize of output 3103 [2024-11-09 05:38:03,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:38:03,769 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 580 treesize of output 560 [2024-11-09 05:38:03,806 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 260 treesize of output 244 [2024-11-09 05:38:03,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:38:03,929 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 355 treesize of output 265 [2024-11-09 05:38:03,958 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 413 treesize of output 347 [2024-11-09 05:38:04,005 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 144 treesize of output 120 [2024-11-09 05:38:04,031 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 211 treesize of output 171 [2024-11-09 05:38:04,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:38:05,097 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 05:38:05,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1482 treesize of output 1337 [2024-11-09 05:38:05,731 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 05:38:05,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 4705 treesize of output 3580 [2024-11-09 05:38:05,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:38:05,947 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 765 treesize of output 749 [2024-11-09 05:38:06,054 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 318 treesize of output 302 [2024-11-09 05:38:06,102 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 384 treesize of output 368 [2024-11-09 05:38:06,144 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 283 treesize of output 251 [2024-11-09 05:38:06,505 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 05:38:06,505 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 834 treesize of output 804 [2024-11-09 05:38:06,570 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 402 treesize of output 326 [2024-11-09 05:38:06,644 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 100 treesize of output 88 [2024-11-09 05:38:07,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:38:08,280 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 05:38:08,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1414 treesize of output 1279 [2024-11-09 05:38:08,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:38:08,467 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 352 treesize of output 344 [2024-11-09 05:38:08,508 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 136 treesize of output 124 [2024-11-09 05:38:08,540 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 235 treesize of output 219 [2024-11-09 05:38:08,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:38:08,596 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 336 treesize of output 246 [2024-11-09 05:38:08,625 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 394 treesize of output 328 [2024-11-09 05:38:08,666 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 211 treesize of output 171 [2024-11-09 05:38:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 05:38:10,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [761502258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:38:10,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974026892] [2024-11-09 05:38:10,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:10,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:38:10,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:38:10,526 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:38:10,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c20102d-5fb3-4044-b6cf-1b98fedc4d27/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-09 05:38:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:10,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-09 05:38:10,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:38:13,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:38:13,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:38:13,853 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:38:13,853 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 [2024-11-09 05:38:13,951 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 6 treesize of output 5 [2024-11-09 05:38:15,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:38:15,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:38:23,313 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 26 treesize of output 14 [2024-11-09 05:38:23,407 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 19 treesize of output 11 [2024-11-09 05:38:25,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:38:25,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:38:26,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:38:26,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:38:26,336 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 11 [2024-11-09 05:38:26,430 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 44 treesize of output 31 [2024-11-09 05:38:27,278 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 05:38:27,278 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 24 treesize of output 26 [2024-11-09 05:38:27,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:38:27,536 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 45 treesize of output 32 [2024-11-09 05:38:27,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:38:27,849 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 7 treesize of output 3 [2024-11-09 05:38:27,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:38:27,896 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-11-09 05:38:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:38:28,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:38:28,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1650 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1649 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1650) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1649) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1650 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1650) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv8 64) .cse1)))))) is different from false [2024-11-09 05:38:55,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1645 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1643))) (store .cse1 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse1 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1645))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv8 64) .cse0)))))) (forall ((v_ArrVal_1644 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1645 (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1643))) (store .cse3 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse3 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1645))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1644))) (store .cse4 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse4 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))))) is different from false [2024-11-09 05:39:23,252 WARN L286 SmtUtils]: Spent 7.53s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 05:39:23,253 INFO L349 Elim1Store]: treesize reduction 10, result has 83.6 percent of original size [2024-11-09 05:39:23,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 291 treesize of output 333 [2024-11-09 05:39:29,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_tail_~head#1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|)) (.cse7 (bvadd (_ bv8 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|))) (let ((.cse1 (select .cse6 .cse7)) (.cse2 (select .cse10 .cse7)) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store .cse10 .cse7 |c_ULTIMATE.start_list_add_tail_~new#1.offset|))) (.cse4 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1644 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (or (= |c_ULTIMATE.start_list_add_tail_~new#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse0 (store .cse3 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1643))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1645))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store .cse6 .cse7 |c_ULTIMATE.start_list_add_tail_~new#1.base|)) |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1644))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4))) (= |c_ULTIMATE.start_list_add_tail_~head#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_prenex_39 (_ BitVec 64)) (v_prenex_41 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_40 (_ BitVec 64)) (v_prenex_38 (Array (_ BitVec 64) (_ BitVec 64)))) (or (= v_prenex_39 |c_ULTIMATE.start_list_add_tail_~head#1.base|) (= v_prenex_39 |c_ULTIMATE.start_list_add_tail_~new#1.base|) (let ((.cse8 (select (select (store (let ((.cse9 (store .cse3 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_prenex_38))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 v_prenex_40))) v_prenex_39 v_prenex_41) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4))) (bvule .cse8 (bvadd (_ bv8 64) .cse8)))))))) is different from false [2024-11-09 05:39:32,337 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse5 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse9 .cse5 |c_ULTIMATE.start_create_~ptr~0#1.offset|))) (.cse2 (select .cse8 .cse5)) (.cse3 (select .cse9 .cse5))) (and (forall ((v_prenex_39 (_ BitVec 64)) (v_prenex_41 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_40 (_ BitVec 64)) (v_prenex_38 (Array (_ BitVec 64) (_ BitVec 64)))) (or (= v_prenex_39 |c_ULTIMATE.start_create_~head~0#1.base|) (let ((.cse0 (select (select (store (let ((.cse1 (store .cse4 |c_ULTIMATE.start_create_~ptr~0#1.base| v_prenex_38))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_40))) v_prenex_39 v_prenex_41) |c_ULTIMATE.start_create_~head~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv8 64) .cse0))) (= v_prenex_39 |c_ULTIMATE.start_create_~ptr~0#1.base|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1644 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (or (= |c_ULTIMATE.start_create_~ptr~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse6 (store .cse4 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1643))) (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 v_ArrVal_1645))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse8 .cse5 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1644))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse3 |c_ULTIMATE.start_create_~ptr~0#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse5))) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))) is different from false [2024-11-09 05:39:33,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1635 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1636 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_39 (_ BitVec 64)) (v_prenex_41 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_40 (_ BitVec 64)) (v_prenex_38 (Array (_ BitVec 64) (_ BitVec 64)))) (or (= v_prenex_39 |c_ULTIMATE.start_create_~head~0#1.base|) (= v_prenex_39 |c_ULTIMATE.start_create_~ptr~0#1.base|) (let ((.cse0 (select (select (store (let ((.cse3 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1636) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse3 .cse4 |c_ULTIMATE.start_create_~ptr~0#1.offset|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_prenex_38)) (.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4))) (store .cse1 .cse2 (store (select .cse1 .cse2) (select .cse3 .cse4) v_prenex_40)))) v_prenex_39 v_prenex_41) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv8 64) .cse0))))) (forall ((v_ArrVal_1635 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1636 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1644 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (or (= |c_ULTIMATE.start_create_~ptr~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|) (let ((.cse8 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1636) |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse10 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse6 (select .cse10 .cse4)) (.cse7 (select .cse8 .cse4))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse8 .cse4 |c_ULTIMATE.start_create_~ptr~0#1.offset|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1643))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_1645))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse10 .cse4 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1644))) (store .cse9 .cse6 (store (select .cse9 .cse6) .cse7 |c_ULTIMATE.start_create_~ptr~0#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4))))) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) is different from false [2024-11-09 05:39:34,017 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 1059 treesize of output 981 [2024-11-09 05:39:42,166 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_prenex_43 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_42 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_42) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse1 (select .cse4 .cse2))) (or (= (_ bv0 64) (bvadd (_ bv8 64) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_prenex_43 .cse2 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1643))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select v_prenex_43 .cse2) v_ArrVal_1645))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1644 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| (select (select (store (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse4 .cse2 |v_ULTIMATE.start_create_~ptr~0#1.base_70|)) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1644))) (store .cse3 .cse1 (store (select .cse3 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_43) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2) |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))))))) (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| |v_ULTIMATE.start_create_~ptr~0#1.base_70|) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (forall ((v_ArrVal_1635 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1636 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_39 (_ BitVec 64)) (v_prenex_41 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_40 (_ BitVec 64)) (v_prenex_38 (Array (_ BitVec 64) (_ BitVec 64)))) (or (= v_prenex_39 |c_ULTIMATE.start_create_~head~0#1.base|) (let ((.cse5 (select (select (store (let ((.cse8 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1636) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse8 .cse2 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_38)) (.cse7 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1635) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (store .cse6 .cse7 (store (select .cse6 .cse7) (select .cse8 .cse2) v_prenex_40)))) v_prenex_39 v_prenex_41) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv8 64) .cse5))) (= v_prenex_39 |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| |v_ULTIMATE.start_create_~ptr~0#1.base_70|) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_43 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1644 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_42 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_42) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse10 (select .cse12 .cse2))) (or (= (_ bv0 64) (bvadd (_ bv8 64) (select (select (store (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_prenex_43 .cse2 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1643))) (store .cse9 .cse10 (store (select .cse9 .cse10) (select v_prenex_43 .cse2) v_ArrVal_1645))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (= |v_ULTIMATE.start_create_~ptr~0#1.base_70| (select (select (store (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse12 .cse2 |v_ULTIMATE.start_create_~ptr~0#1.base_70|)) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1644))) (store .cse11 .cse10 (store (select .cse11 .cse10) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_43) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2) |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))))) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| |v_ULTIMATE.start_create_~ptr~0#1.base_70|) (forall ((v_prenex_43 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_42 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse15 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_43) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse15 .cse2 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1643)) (.cse14 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_42) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (store .cse13 .cse14 (store (select .cse13 .cse14) (select .cse15 .cse2) v_ArrVal_1645)))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)) (_ bv20 64))) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))))) is different from true [2024-11-09 05:39:45,513 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:46,107 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 05:39:46,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1819 treesize of output 1812 [2024-11-09 05:39:46,158 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:46,726 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 05:39:46,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1571 treesize of output 1140 [2024-11-09 05:39:46,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:39:46,941 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 302 treesize of output 298 [2024-11-09 05:39:47,332 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 05:39:47,333 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 762 treesize of output 734 [2024-11-09 05:39:47,393 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 219 treesize of output 199 [2024-11-09 05:39:47,422 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 326 treesize of output 254 [2024-11-09 05:39:47,486 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 122 treesize of output 110 [2024-11-09 05:39:47,552 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 70 treesize of output 58 [2024-11-09 05:39:47,998 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:47,999 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:48,044 INFO L349 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2024-11-09 05:39:48,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 497 treesize of output 1 [2024-11-09 05:39:48,074 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:48,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:48,122 INFO L349 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2024-11-09 05:39:48,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1332 treesize of output 1 [2024-11-09 05:39:48,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:48,152 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:48,197 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 05:39:48,197 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 436 treesize of output 1 [2024-11-09 05:39:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 05:39:53,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974026892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:39:53,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 05:39:53,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14, 16, 16, 17] total 56 [2024-11-09 05:39:53,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465375555] [2024-11-09 05:39:53,720 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 05:39:53,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-09 05:39:53,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:39:53,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-09 05:39:53,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1899, Unknown=72, NotChecked=990, Total=3192 [2024-11-09 05:39:53,723 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 57 states, 56 states have (on average 1.7142857142857142) internal successors, (96), 57 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:40:00,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:40:02,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:40:12,037 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (let ((.cse28 (select .cse27 .cse3))) (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse10 (bvadd .cse28 (_ bv8 64)))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse0 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1415 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1414 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1425 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1414) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse2 (select .cse5 .cse3))) (or (= (bvadd (_ bv8 64) (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_ArrVal_1415 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1423))) (store .cse1 .cse2 (store (select .cse1 .cse2) (select v_ArrVal_1415 .cse3) v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (_ bv0 64)) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (select (store (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse5 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_60|)) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1422))) (store .cse4 .cse2 (store (select .cse4 .cse2) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1415) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_prenex_43 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_42 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_42) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse7 (select .cse9 .cse3))) (or (= (_ bv0 64) (bvadd (_ bv8 64) (select (select (store (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_prenex_43 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1643))) (store .cse6 .cse7 (store (select .cse6 .cse7) (select v_prenex_43 .cse3) v_ArrVal_1645))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1644 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| (select (select (store (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse9 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_70|)) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1644))) (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_43) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))))))) (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| |v_ULTIMATE.start_create_~ptr~0#1.base_70|) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (bvule .cse10 (select |c_#length| (select .cse11 .cse3))) (= (_ bv0 64) |c_ULTIMATE.start_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse12 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse12 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1415 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1414 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1425 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse16 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1414) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse14 (select .cse16 .cse3))) (or (= (bvadd (_ bv8 64) (select (select (store (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_ArrVal_1415 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1423))) (store .cse13 .cse14 (store (select .cse13 .cse14) (select v_ArrVal_1415 .cse3) v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (_ bv0 64)) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store (let ((.cse15 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse16 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_60|)) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1422))) (store .cse15 .cse14 (store (select .cse15 .cse14) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1415) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_60|)))))) (not (= (_ bv0 1) (select .cse12 |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse17 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse17 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((v_prenex_4 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_prenex_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_6 (Array (_ BitVec 64) (_ BitVec 64)))) (or (let ((.cse18 (select (select (store (let ((.cse21 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_prenex_1) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse19 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse21 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_prenex_3)) (.cse20 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_prenex_2) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (store .cse19 .cse20 (store (select .cse19 .cse20) (select .cse21 .cse3) v_prenex_5)))) v_prenex_4 v_prenex_6) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse18 (bvadd .cse18 (_ bv8 64)))) (not (= (_ bv0 1) (select .cse17 v_prenex_4)))))))) (= (select .cse11 (_ bv8 64)) |c_ULTIMATE.start_create_~head~0#1.base|) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (forall ((v_ArrVal_1635 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1636 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_39 (_ BitVec 64)) (v_prenex_41 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_40 (_ BitVec 64)) (v_prenex_38 (Array (_ BitVec 64) (_ BitVec 64)))) (or (= v_prenex_39 |c_ULTIMATE.start_create_~head~0#1.base|) (let ((.cse22 (select (select (store (let ((.cse25 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1636) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse23 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse25 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_38)) (.cse24 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1635) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (store .cse23 .cse24 (store (select .cse23 .cse24) (select .cse25 .cse3) v_prenex_40)))) v_prenex_39 v_prenex_41) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse22 (bvadd (_ bv8 64) .cse22))) (= v_prenex_39 |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse26 (bvadd (_ bv8 64) .cse26)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (= (_ bv0 64) (select .cse27 (_ bv8 64))) (bvule .cse28 .cse10) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| |v_ULTIMATE.start_create_~ptr~0#1.base_70|) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_43 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1644 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_42 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse32 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_42) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse30 (select .cse32 .cse3))) (or (= (_ bv0 64) (bvadd (_ bv8 64) (select (select (store (let ((.cse29 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_prenex_43 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1643))) (store .cse29 .cse30 (store (select .cse29 .cse30) (select v_prenex_43 .cse3) v_ArrVal_1645))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (= |v_ULTIMATE.start_create_~ptr~0#1.base_70| (select (select (store (let ((.cse31 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse32 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_70|)) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1644))) (store .cse31 .cse30 (store (select .cse31 .cse30) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_43) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))))) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| |v_ULTIMATE.start_create_~ptr~0#1.base_70|) (forall ((v_prenex_43 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_42 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse35 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_43) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse33 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse35 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1643)) (.cse34 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_42) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (store .cse33 .cse34 (store (select .cse33 .cse34) (select .cse35 .cse3) v_ArrVal_1645)))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (_ bv20 64))) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse36 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse36 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1415 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1414 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1425 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store (let ((.cse39 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1415) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse39 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1423)) (.cse38 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1414) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (store .cse37 .cse38 (store (select .cse37 .cse38) (select .cse39 .cse3) v_ArrVal_1425)))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) (_ bv8 64)) (_ bv20 64))) (not (= (_ bv0 1) (select .cse36 |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))))))))) is different from true [2024-11-09 05:40:14,116 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse0 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1415 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1414 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1425 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1414) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse2 (select .cse5 .cse3))) (or (= (bvadd (_ bv8 64) (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_ArrVal_1415 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1423))) (store .cse1 .cse2 (store (select .cse1 .cse2) (select v_ArrVal_1415 .cse3) v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (_ bv0 64)) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (select (store (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse5 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_60|)) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1422))) (store .cse4 .cse2 (store (select .cse4 .cse2) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1415) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_prenex_43 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_42 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_42) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse7 (select .cse9 .cse3))) (or (= (_ bv0 64) (bvadd (_ bv8 64) (select (select (store (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_prenex_43 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1643))) (store .cse6 .cse7 (store (select .cse6 .cse7) (select v_prenex_43 .cse3) v_ArrVal_1645))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1644 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| (select (select (store (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse9 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_70|)) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1644))) (store .cse8 .cse7 (store (select .cse8 .cse7) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_43) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))))))) (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| |v_ULTIMATE.start_create_~ptr~0#1.base_70|) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (= (_ bv0 64) |c_ULTIMATE.start_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse10 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse10 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1415 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1414 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1425 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse14 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1414) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse12 (select .cse14 .cse3))) (or (= (bvadd (_ bv8 64) (select (select (store (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_ArrVal_1415 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1423))) (store .cse11 .cse12 (store (select .cse11 .cse12) (select v_ArrVal_1415 .cse3) v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (_ bv0 64)) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store (let ((.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse14 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_60|)) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1422))) (store .cse13 .cse12 (store (select .cse13 .cse12) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1415) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_60|)))))) (not (= (_ bv0 1) (select .cse10 |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse15 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse15 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((v_prenex_4 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_prenex_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_3 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_1 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_6 (Array (_ BitVec 64) (_ BitVec 64)))) (or (let ((.cse16 (select (select (store (let ((.cse19 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_prenex_1) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse17 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse19 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_prenex_3)) (.cse18 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_prenex_2) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (store .cse17 .cse18 (store (select .cse17 .cse18) (select .cse19 .cse3) v_prenex_5)))) v_prenex_4 v_prenex_6) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse16 (bvadd .cse16 (_ bv8 64)))) (not (= (_ bv0 1) (select .cse15 v_prenex_4)))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base|) (_ bv8 64)) |c_ULTIMATE.start_create_~head~0#1.base|) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (forall ((v_ArrVal_1635 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1636 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_39 (_ BitVec 64)) (v_prenex_41 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_40 (_ BitVec 64)) (v_prenex_38 (Array (_ BitVec 64) (_ BitVec 64)))) (or (= v_prenex_39 |c_ULTIMATE.start_create_~head~0#1.base|) (let ((.cse20 (select (select (store (let ((.cse23 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1636) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse23 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_38)) (.cse22 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1635) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (store .cse21 .cse22 (store (select .cse21 .cse22) (select .cse23 .cse3) v_prenex_40)))) v_prenex_39 v_prenex_41) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse20 (bvadd (_ bv8 64) .cse20))) (= v_prenex_39 |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))))) (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base|) (_ bv8 64))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| |v_ULTIMATE.start_create_~ptr~0#1.base_70|) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_43 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1644 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_42 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse27 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_42) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse25 (select .cse27 .cse3))) (or (= (_ bv0 64) (bvadd (_ bv8 64) (select (select (store (let ((.cse24 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store v_prenex_43 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1643))) (store .cse24 .cse25 (store (select .cse24 .cse25) (select v_prenex_43 .cse3) v_ArrVal_1645))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (= |v_ULTIMATE.start_create_~ptr~0#1.base_70| (select (select (store (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse27 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_70|)) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1644))) (store .cse26 .cse25 (store (select .cse26 .cse25) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_43) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))))) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_70| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_70|))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (= |v_ULTIMATE.start_create_~ptr~0#1.base_58| |v_ULTIMATE.start_create_~ptr~0#1.base_70|) (forall ((v_prenex_43 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1643 (Array (_ BitVec 64) (_ BitVec 64))) (v_prenex_42 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1645 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse30 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_43) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse28 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse30 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_ArrVal_1643)) (.cse29 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_70| v_prenex_42) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (store .cse28 .cse29 (store (select .cse28 .cse29) (select .cse30 .cse3) v_ArrVal_1645)))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (_ bv20 64))) (= |c_ULTIMATE.start_create_~head~0#1.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ BitVec 64))) (let ((.cse31 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_60|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse31 |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1415 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1414 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1425 (_ BitVec 64)) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store (let ((.cse34 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1415) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse32 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse34 .cse3 (_ bv0 64))) |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1423)) (.cse33 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_60| v_ArrVal_1414) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (store .cse32 .cse33 (store (select .cse32 .cse33) (select .cse34 .cse3) v_ArrVal_1425)))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) (_ bv8 64)) (_ bv20 64))) (not (= (_ bv0 1) (select .cse31 |v_ULTIMATE.start_create_~ptr~0#1.base_58|)))))))))) is different from true [2024-11-09 05:40:16,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:40:17,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:40:21,393 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 [1] [2024-11-09 05:40:22,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:40:24,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:40:42,570 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse2 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (let ((.cse17 (select .cse16 .cse2)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse4 (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~next#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~next#1.base|) .cse4 |c_ULTIMATE.start___list_add_~new#1.offset|))) (.cse8 (select .cse7 (_ bv8 64))) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~prev#1.base|)) (.cse9 (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~prev#1.offset|)) (.cse6 (bvadd .cse17 (_ bv8 64)))) (and (not (= |c_ULTIMATE.start___list_add_~new#1.base| |c_ULTIMATE.start_create_~head~0#1.base|)) (forall ((v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1423))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base|) .cse4 |c_ULTIMATE.start___list_add_~new#1.base|)) |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1422))) (store .cse3 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse3 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))))) (= (_ bv0 64) |c_ULTIMATE.start___list_add_~next#1.offset|) (= |c_ULTIMATE.start_create_~head~0#1.base| |c_ULTIMATE.start___list_add_~next#1.base|) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~prev#1.base| (store .cse5 |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1425)) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~prev#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|)) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (bvule .cse6 (select |c_#length| (select .cse7 .cse2))) (= (_ bv0 64) |c_ULTIMATE.start_create_~head~0#1.offset|) (= .cse8 |c_ULTIMATE.start___list_add_~prev#1.base|) (bvule .cse9 (select |c_#length| |c_ULTIMATE.start___list_add_~prev#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|))) (forall ((v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse10 (select (select (store (let ((.cse11 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1423))) (store .cse11 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse11 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (bvule .cse10 (bvadd (_ bv8 64) .cse10)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (= .cse8 |c_ULTIMATE.start_create_~head~0#1.base|) (= (_ bv0 64) |c_ULTIMATE.start___list_add_~new#1.offset|) (= (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start___list_add_~new#1.base|)) (_ bv0 1)) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (bvule .cse12 (bvadd (_ bv8 64) .cse12)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~prev#1.base| (store .cse5 |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1425)) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (bvule .cse13 (bvadd (_ bv8 64) .cse13)))))) (bvule |c_ULTIMATE.start___list_add_~prev#1.offset| .cse9) (forall ((v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse14 (select (select (store (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1423))) (store .cse15 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse15 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (bvule .cse14 (bvadd (_ bv8 64) .cse14)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (= (_ bv0 64) (select .cse16 (_ bv8 64))) (bvule .cse17 .cse6) (= (_ bv0 64) |c_ULTIMATE.start___list_add_~prev#1.offset|) (forall ((v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1423))) (store .cse18 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse18 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1422))) (store .cse19 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse19 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (= (_ bv20 64) (select |c_#length| |c_ULTIMATE.start___list_add_~new#1.base|)))))) is different from true [2024-11-09 05:41:07,156 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 [1] [2024-11-09 05:41:09,228 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 [1] [2024-11-09 05:41:11,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:41:13,452 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 [1] [2024-11-09 05:41:15,558 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 [1] [2024-11-09 05:41:17,737 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 [1] [2024-11-09 05:41:19,780 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 [1] [2024-11-09 05:41:21,809 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 [1] [2024-11-09 05:41:33,234 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 [1] [2024-11-09 05:41:35,285 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 [1] [2024-11-09 05:41:37,373 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 [1] [2024-11-09 05:41:39,409 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 [1] [2024-11-09 05:41:41,442 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 [1] [2024-11-09 05:41:42,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:41:44,909 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 [1] [2024-11-09 05:41:46,961 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 [1] [2024-11-09 05:41:49,083 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] [2024-11-09 05:41:51,092 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] [2024-11-09 05:41:53,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:41:55,035 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 [1] [2024-11-09 05:41:57,091 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 [1] [2024-11-09 05:41:59,119 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 [1] [2024-11-09 05:42:01,148 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 [1] [2024-11-09 05:42:09,298 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse10 (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|))))) (let ((.cse1 (not .cse10)) (.cse12 (select .cse11 (_ bv0 64))) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse30 .cse0 |c_ULTIMATE.start_create_~ptr~0#1.offset|))) (.cse4 (select .cse30 .cse0)) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse11 .cse0 |c_ULTIMATE.start_create_~ptr~0#1.base|))) (.cse3 (select .cse11 .cse0))) (and (forall ((v_ArrVal_1650 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1649 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1650) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1649) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))) (= (_ bv0 64) |c_ULTIMATE.start_create_~head~0#1.offset|) (or .cse1 (and (forall ((v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (select (select (store (let ((.cse2 (store .cse5 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1423))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse6 (store .cse7 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1422))) (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 |c_ULTIMATE.start_create_~ptr~0#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))))) (forall ((v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (store (let ((.cse9 (store .cse5 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1423))) (store .cse9 .cse3 (store (select .cse9 .cse3) .cse4 v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (bvule .cse8 (bvadd .cse8 (_ bv8 64))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))))) .cse10 (= (select .cse11 (_ bv8 64)) .cse12) (forall ((v_ArrVal_1525 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse18 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse14 (select .cse18 .cse0))) (or (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1526 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1533 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1538 (_ BitVec 64))) (let ((.cse16 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1526) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse15 (select .cse16 .cse0))) (bvule (bvadd (select (select (store (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse16 .cse0 |c_ULTIMATE.start_create_~ptr~0#1.offset|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1534))) (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1538) (select (select (store (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse18 .cse0 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1533))) (store .cse17 .cse14 (store (select .cse17 .cse14) .cse15 |c_ULTIMATE.start_create_~ptr~0#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse14)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse12))) (or .cse1 (and (forall ((v_ArrVal_1415 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1414 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse19 (select (select (store (let ((.cse22 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse22 .cse0 |c_ULTIMATE.start_create_~ptr~0#1.offset|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1423)) (.cse21 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (store .cse20 .cse21 (store (select .cse20 .cse21) (select .cse22 .cse0) v_ArrVal_1425)))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (bvule .cse19 (bvadd (_ bv8 64) .cse19)))))) (forall ((v_ArrVal_1415 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1414 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (let ((.cse26 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse28 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse24 (select .cse28 .cse0)) (.cse25 (select .cse26 .cse0))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse23 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse26 .cse0 |c_ULTIMATE.start_create_~ptr~0#1.offset|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1423))) (store .cse23 .cse24 (store (select .cse23 .cse24) .cse25 v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse27 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse28 .cse0 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1422))) (store .cse27 .cse24 (store (select .cse27 .cse24) .cse25 |c_ULTIMATE.start_create_~ptr~0#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))))) (not (= |c_ULTIMATE.start_create_~ptr~0#1.base| .cse12)) (forall ((v_ArrVal_1650 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse29 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1650) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (bvule .cse29 (bvadd (_ bv8 64) .cse29)))) (not (= |c_ULTIMATE.start_create_~head~0#1.base| .cse12)) (= (_ bv0 64) (select .cse30 (_ bv8 64))) (not (= |c_ULTIMATE.start_create_~head~0#1.base| |c_ULTIMATE.start_create_~ptr~0#1.base|)) (= (_ bv20 64) (select |c_#length| .cse12)) (forall ((v_ArrVal_1525 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse33 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (or (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1526 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse31 (select (select (store (let ((.cse34 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1526) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse32 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse34 .cse0 |c_ULTIMATE.start_create_~ptr~0#1.offset|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1534))) (store .cse32 .cse33 (store (select .cse32 .cse33) (select .cse34 .cse0) v_ArrVal_1535)))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (bvule .cse31 (bvadd .cse31 (_ bv8 64))))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse33))))))) (or (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse35 (select (select (store (let ((.cse36 (store .cse5 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1534))) (store .cse36 .cse3 (store (select .cse36 .cse3) .cse4 v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (bvule .cse35 (bvadd (_ bv8 64) .cse35)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1533 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1538 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse37 (store .cse5 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1534))) (store .cse37 .cse3 (store (select .cse37 .cse3) .cse4 v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1538) (select (select (store (let ((.cse38 (store .cse7 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1533))) (store .cse38 .cse3 (store (select .cse38 .cse3) .cse4 |c_ULTIMATE.start_create_~ptr~0#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse3)))))))) is different from true [2024-11-09 05:42:10,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:42:14,476 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse4 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)) (.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse10 (select .cse9 (_ bv0 64))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse11 .cse4 |c_ULTIMATE.start_create_~ptr~0#1.offset|))) (.cse2 (select .cse11 .cse4)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse9 .cse4 |c_ULTIMATE.start_create_~ptr~0#1.base|))) (.cse1 (select .cse9 .cse4))) (and (= (_ bv0 64) |c_ULTIMATE.start_create_~head~0#1.offset|) (or (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|)))) (and (forall ((v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (select (select (store (let ((.cse0 (store .cse3 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1423))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse5 (store .cse6 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1422))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |c_ULTIMATE.start_create_~ptr~0#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4)))))) (forall ((v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (store (let ((.cse8 (store .cse3 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1423))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4))) (bvule .cse7 (bvadd .cse7 (_ bv8 64))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))))) (= (select .cse9 (_ bv8 64)) .cse10) (not (= |c_ULTIMATE.start_create_~head~0#1.base| .cse10)) (= (_ bv0 64) (select .cse11 (_ bv8 64))) (= (_ bv20 64) (select |c_#length| .cse10)) (or (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (select (select (store (let ((.cse13 (store .cse3 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1534))) (store .cse13 .cse1 (store (select .cse13 .cse1) .cse2 v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4))) (bvule .cse12 (bvadd (_ bv8 64) .cse12)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1533 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1538 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse14 (store .cse3 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1534))) (store .cse14 .cse1 (store (select .cse14 .cse1) .cse2 v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1538) (select (select (store (let ((.cse15 (store .cse6 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1533))) (store .cse15 .cse1 (store (select .cse15 .cse1) .cse2 |c_ULTIMATE.start_create_~ptr~0#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse4))))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse1)))))))) is different from true [2024-11-09 05:42:30,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:42:33,629 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 [1] [2024-11-09 05:42:35,661 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 [1] [2024-11-09 05:42:37,765 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 [1] [2024-11-09 05:42:40,642 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] [2024-11-09 05:42:43,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:42:44,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:42:48,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:42:50,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:42:52,263 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] [2024-11-09 05:42:54,407 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] [2024-11-09 05:42:56,509 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 [1] [2024-11-09 05:42:58,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:43:00,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:43:00,820 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|)) (.cse23 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_tail_~head#1.base|)) (.cse24 (bvadd (_ bv8 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store .cse23 .cse24 |c_ULTIMATE.start_list_add_tail_~new#1.offset|))) (.cse13 (select .cse18 .cse24)) (.cse14 (select .cse23 .cse24)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store .cse18 .cse24 |c_ULTIMATE.start_list_add_tail_~new#1.base|))) (.cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)) (.cse11 (select .cse18 (_ bv0 64)))) (and (or (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|)))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (let ((.cse1 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1534))) (store .cse1 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse1 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv8 64) .cse0)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1533 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1538 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1534))) (store .cse4 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse4 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1538) (select (select (store (let ((.cse5 (store .cse6 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1533))) (store .cse5 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse5 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (select (select (store (let ((.cse7 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1423))) (store .cse7 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse7 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse8 (store .cse6 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1422))) (store .cse8 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse8 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (not (= |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|)) (= (_ bv0 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|) (forall ((v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (select (select (store (let ((.cse10 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1423))) (store .cse10 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse10 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse9 (bvadd .cse9 (_ bv8 64))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (not (= .cse11 |c_ULTIMATE.start_list_add_tail_~head#1.base|)) (= (_ bv0 64) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset|) (or (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1533 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1538 (_ BitVec 64))) (bvule (bvadd (select (select (store (let ((.cse12 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1534))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1538) (select (select (store (let ((.cse15 (store .cse6 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1533))) (store .cse15 .cse13 (store (select .cse15 .cse13) .cse14 |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse16 (select (select (store (let ((.cse17 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1534))) (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse16 (bvadd .cse16 (_ bv8 64))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|)))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse13))))) (= (select |c_#length| |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) (_ bv20 64)) (= (select .cse18 (_ bv8 64)) .cse11) (or (not (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_list_add_tail_~head#1.base|) (_ bv1 1)))) (and (forall ((v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse19 (select (select (store (let ((.cse20 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1423))) (store .cse20 .cse13 (store (select .cse20 .cse13) .cse14 v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse19 (bvadd (_ bv8 64) .cse19)))))) (forall ((v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse21 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1423))) (store .cse21 .cse13 (store (select .cse21 .cse13) .cse14 v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse22 (store .cse6 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1422))) (store .cse22 .cse13 (store (select .cse22 .cse13) .cse14 |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))))) (= (_ bv20 64) (select |c_#length| .cse11)) (= (_ bv0 64) (select .cse23 (_ bv8 64)))))) is different from false [2024-11-09 05:43:02,833 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|)) (.cse23 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_tail_~head#1.base|)) (.cse24 (bvadd (_ bv8 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store .cse23 .cse24 |c_ULTIMATE.start_list_add_tail_~new#1.offset|))) (.cse13 (select .cse18 .cse24)) (.cse14 (select .cse23 .cse24)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store .cse18 .cse24 |c_ULTIMATE.start_list_add_tail_~new#1.base|))) (.cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)) (.cse11 (select .cse18 (_ bv0 64)))) (and (or (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|)))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (let ((.cse1 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1534))) (store .cse1 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse1 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv8 64) .cse0)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1533 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1538 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1534))) (store .cse4 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse4 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1538) (select (select (store (let ((.cse5 (store .cse6 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1533))) (store .cse5 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse5 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (select (select (store (let ((.cse7 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1423))) (store .cse7 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse7 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse8 (store .cse6 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1422))) (store .cse8 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse8 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (not (= |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|)) (= (_ bv0 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|) (forall ((v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (select (select (store (let ((.cse10 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1423))) (store .cse10 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse10 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse9 (bvadd .cse9 (_ bv8 64))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (not (= .cse11 |c_ULTIMATE.start_list_add_tail_~head#1.base|)) (= (_ bv0 64) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset|) (or (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1533 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1538 (_ BitVec 64))) (bvule (bvadd (select (select (store (let ((.cse12 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1534))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1538) (select (select (store (let ((.cse15 (store .cse6 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1533))) (store .cse15 .cse13 (store (select .cse15 .cse13) .cse14 |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse16 (select (select (store (let ((.cse17 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1534))) (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse16 (bvadd .cse16 (_ bv8 64))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|)))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse13))))) (= (select |c_#length| |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) (_ bv20 64)) (= (select .cse18 (_ bv8 64)) .cse11) (or (not (= (_ bv0 1) (bvadd (select |c_#valid| |c_ULTIMATE.start_list_add_tail_~head#1.base|) (_ bv1 1)))) (and (forall ((v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse19 (select (select (store (let ((.cse20 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1423))) (store .cse20 .cse13 (store (select .cse20 .cse13) .cse14 v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse19 (bvadd (_ bv8 64) .cse19)))))) (forall ((v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse21 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1423))) (store .cse21 .cse13 (store (select .cse21 .cse13) .cse14 v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse22 (store .cse6 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1422))) (store .cse22 .cse13 (store (select .cse22 .cse13) .cse14 |c_ULTIMATE.start_list_add_tail_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))))) (= (_ bv20 64) (select |c_#length| .cse11)) (= (_ bv0 64) (select .cse23 (_ bv8 64)))))) is different from true [2024-11-09 05:43:02,973 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~next#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~next#1.base|) .cse11 |c_ULTIMATE.start___list_add_~new#1.offset|))) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base|) .cse11 |c_ULTIMATE.start___list_add_~new#1.base|))) (.cse2 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1422 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1427 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1423))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1427) (select (select (store (let ((.cse3 (store .cse4 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1422))) (store .cse3 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse3 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1423 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_58| (_ BitVec 64)) (v_ArrVal_1425 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (let ((.cse6 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1423))) (store .cse6 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse6 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1425))) |v_ULTIMATE.start_create_~ptr~0#1.base_58| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv8 64) .cse5)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_58|))))) (= (_ bv20 64) (select |c_#length| |c_ULTIMATE.start___list_add_~prev#1.base|)) (or (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (forall ((v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (store (let ((.cse8 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1534))) (store .cse8 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse8 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (bvule .cse7 (bvadd (_ bv8 64) .cse7)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_63| (_ BitVec 64)) (v_ArrVal_1534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1533 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1535 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_63|))) (forall ((v_ArrVal_1428 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1429 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1538 (_ BitVec 64))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse9 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1534))) (store .cse9 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse9 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1535))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1429) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1538) (select (select (store (let ((.cse10 (store .cse4 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1533))) (store .cse10 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse10 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| |c_ULTIMATE.start___list_add_~new#1.base|))) |v_ULTIMATE.start_create_~ptr~0#1.base_63| v_ArrVal_1428) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start___list_add_~prev#1.base|))))) (= (_ bv0 64) |c_ULTIMATE.start___list_add_~prev#1.offset|)))) is different from false [2024-11-09 05:43:34,399 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 [1] [2024-11-09 05:43:36,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:43:38,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:43:40,832 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] [2024-11-09 05:43:42,859 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 [1] [2024-11-09 05:43:46,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:43:48,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:43:51,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:43:55,473 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] [2024-11-09 05:43:57,660 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] [2024-11-09 05:43:59,687 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 [1] [2024-11-09 05:44:01,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:44:03,232 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 [1] [2024-11-09 05:44:42,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 05:44:44,712 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 [1] [2024-11-09 05:44:46,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]