./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:14:59,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:14:59,743 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:14:59,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:14:59,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:14:59,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:14:59,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:14:59,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:14:59,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:14:59,772 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:14:59,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:14:59,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:14:59,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:14:59,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:14:59,775 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:14:59,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:14:59,776 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:14:59,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:14:59,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:14:59,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:14:59,778 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:14:59,780 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:14:59,780 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:14:59,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:14:59,781 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:14:59,781 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:14:59,782 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:14:59,782 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:14:59,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:14:59,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:14:59,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:14:59,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:14:59,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:14:59,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:14:59,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:14:59,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:14:59,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:14:59,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:14:59,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:14:59,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:14:59,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:14:59,787 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2023-11-29 03:14:59,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:15:00,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:15:00,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:15:00,009 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:15:00,009 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:15:00,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2023-11-29 03:15:02,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:15:03,155 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:15:03,156 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2023-11-29 03:15:03,167 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/data/5af2ef08b/581a6ad1bad042e5b1d9a83a663db9d8/FLAG91207af1d [2023-11-29 03:15:03,179 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/data/5af2ef08b/581a6ad1bad042e5b1d9a83a663db9d8 [2023-11-29 03:15:03,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:15:03,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:15:03,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:03,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:15:03,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:15:03,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:03" (1/1) ... [2023-11-29 03:15:03,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d37933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:03, skipping insertion in model container [2023-11-29 03:15:03,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:03" (1/1) ... [2023-11-29 03:15:03,234 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:15:03,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:03,514 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 03:15:03,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1bc1c61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:03, skipping insertion in model container [2023-11-29 03:15:03,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:03,515 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 03:15:03,517 INFO L158 Benchmark]: Toolchain (without parser) took 334.00ms. Allocated memory is still 153.1MB. Free memory was 105.9MB in the beginning and 94.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 03:15:03,519 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:15:03,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.00ms. Allocated memory is still 153.1MB. Free memory was 105.9MB in the beginning and 94.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 03:15:03,521 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.13ms. Allocated memory is still 113.2MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.00ms. Allocated memory is still 153.1MB. Free memory was 105.9MB in the beginning and 94.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: 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_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:15:05,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:15:05,407 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 03:15:05,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:15:05,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:15:05,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:15:05,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:15:05,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:15:05,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:15:05,440 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:15:05,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:15:05,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:15:05,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:15:05,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:15:05,443 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:15:05,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:15:05,444 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:15:05,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:15:05,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:15:05,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:15:05,446 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:15:05,446 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:15:05,447 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:15:05,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:15:05,448 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:15:05,448 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:15:05,449 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:15:05,449 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:15:05,449 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:15:05,450 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:15:05,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:15:05,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:15:05,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:15:05,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:15:05,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:15:05,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:15:05,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:15:05,452 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:15:05,452 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:15:05,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:15:05,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:15:05,453 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:15:05,453 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:15:05,453 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:15:05,454 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2023-11-29 03:15:05,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:15:05,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:15:05,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:15:05,756 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:15:05,756 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:15:05,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2023-11-29 03:15:08,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:15:08,850 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:15:08,850 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2023-11-29 03:15:08,863 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/data/e3eeb68a4/48a050d3b742490aa2f0b564e56dd638/FLAG9847547b2 [2023-11-29 03:15:08,875 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/data/e3eeb68a4/48a050d3b742490aa2f0b564e56dd638 [2023-11-29 03:15:08,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:15:08,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:15:08,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:08,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:15:08,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:15:08,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:08" (1/1) ... [2023-11-29 03:15:08,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8914c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:08, skipping insertion in model container [2023-11-29 03:15:08,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:08" (1/1) ... [2023-11-29 03:15:08,927 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:15:09,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:09,209 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 03:15:09,217 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:15:09,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:09,264 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:15:09,300 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:09,332 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:15:09,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09 WrapperNode [2023-11-29 03:15:09,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:09,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:15:09,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:15:09,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:15:09,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,383 INFO L138 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2023-11-29 03:15:09,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:15:09,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:15:09,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:15:09,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:15:09,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,418 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 6, 2]. [2023-11-29 03:15:09,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:15:09,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:15:09,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:15:09,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:15:09,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (1/1) ... [2023-11-29 03:15:09,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:15:09,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:15:09,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:15:09,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:15:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:15:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:15:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:15:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:15:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:15:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:15:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:15:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:15:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:15:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:15:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:15:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:15:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 03:15:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 03:15:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 03:15:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 03:15:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:15:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:15:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 03:15:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:15:09,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:15:09,639 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:15:09,641 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:15:10,125 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:15:10,173 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:15:10,173 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 03:15:10,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:15:10 BoogieIcfgContainer [2023-11-29 03:15:10,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:15:10,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:15:10,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:15:10,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:15:10,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:15:08" (1/3) ... [2023-11-29 03:15:10,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6ef3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:15:10, skipping insertion in model container [2023-11-29 03:15:10,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:09" (2/3) ... [2023-11-29 03:15:10,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6ef3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:15:10, skipping insertion in model container [2023-11-29 03:15:10,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:15:10" (3/3) ... [2023-11-29 03:15:10,183 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2023-11-29 03:15:10,202 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:15:10,203 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2023-11-29 03:15:10,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:15:10,251 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4cb7be08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:15:10,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2023-11-29 03:15:10,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 42 states have (on average 2.3333333333333335) internal successors, (98), 88 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) [2023-11-29 03:15:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 03:15:10,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:10,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 03:15:10,261 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:10,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash 187589, now seen corresponding path program 1 times [2023-11-29 03:15:10,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:10,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218025652] [2023-11-29 03:15:10,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:10,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:10,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:10,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 03:15:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:10,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:15:10,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:10,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:10,543 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:15:10,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 03:15:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:10,567 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:10,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:10,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218025652] [2023-11-29 03:15:10,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218025652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:10,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:10,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:10,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988918399] [2023-11-29 03:15:10,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:10,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:15:10,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:10,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:15:10,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:15:10,599 INFO L87 Difference]: Start difference. First operand has 89 states, 42 states have (on average 2.3333333333333335) internal successors, (98), 88 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) Second operand has 4 states, 3 states have (on average 1.0) 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) [2023-11-29 03:15:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:10,957 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2023-11-29 03:15:10,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:15:10,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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 [2023-11-29 03:15:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:10,968 INFO L225 Difference]: With dead ends: 93 [2023-11-29 03:15:10,969 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 03:15:10,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:10,973 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 107 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:10,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 74 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:15:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 03:15:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2023-11-29 03:15:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 44 states have (on average 2.090909090909091) internal successors, (92), 84 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) [2023-11-29 03:15:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-11-29 03:15:11,011 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 3 [2023-11-29 03:15:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:11,011 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-11-29 03:15:11,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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) [2023-11-29 03:15:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-11-29 03:15:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 03:15:11,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:11,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 03:15:11,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:15:11,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:11,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:11,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash 187590, now seen corresponding path program 1 times [2023-11-29 03:15:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:11,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242909994] [2023-11-29 03:15:11,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:11,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:11,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:11,218 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:11,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 03:15:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:11,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:15:11,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:11,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:11,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:15:11,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:15:11,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:15:11,396 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:15:11,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:15:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:11,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:11,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:11,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242909994] [2023-11-29 03:15:11,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242909994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:11,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:11,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:11,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278557491] [2023-11-29 03:15:11,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:11,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:15:11,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:11,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:15:11,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:15:11,420 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 3 states have (on average 1.0) 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) [2023-11-29 03:15:11,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:11,919 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2023-11-29 03:15:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:15:11,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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 [2023-11-29 03:15:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:11,921 INFO L225 Difference]: With dead ends: 128 [2023-11-29 03:15:11,921 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 03:15:11,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:11,923 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 85 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:11,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 85 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:15:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 03:15:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2023-11-29 03:15:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2023-11-29 03:15:11,934 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 3 [2023-11-29 03:15:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:11,934 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2023-11-29 03:15:11,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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) [2023-11-29 03:15:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2023-11-29 03:15:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:15:11,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:11,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:15:11,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 03:15:12,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:12,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:12,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash 5815239, now seen corresponding path program 1 times [2023-11-29 03:15:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:12,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349332412] [2023-11-29 03:15:12,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:12,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:12,159 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:12,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 03:15:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:12,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:15:12,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:12,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:12,228 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:12,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:12,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349332412] [2023-11-29 03:15:12,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349332412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:12,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:12,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:12,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820745413] [2023-11-29 03:15:12,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:12,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:15:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:12,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:15:12,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:12,231 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:12,386 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2023-11-29 03:15:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:15:12,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 03:15:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:12,388 INFO L225 Difference]: With dead ends: 94 [2023-11-29 03:15:12,388 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 03:15:12,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:12,390 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:12,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 94 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:15:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 03:15:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-29 03:15:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2023-11-29 03:15:12,399 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 4 [2023-11-29 03:15:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:12,399 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2023-11-29 03:15:12,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2023-11-29 03:15:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:15:12,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:12,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:15:12,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 03:15:12,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:12,601 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:12,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:12,602 INFO L85 PathProgramCache]: Analyzing trace with hash 5815240, now seen corresponding path program 1 times [2023-11-29 03:15:12,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:12,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696376148] [2023-11-29 03:15:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:12,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:12,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:12,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:12,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 03:15:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:12,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:15:12,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:12,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:15:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:12,705 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:12,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:12,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696376148] [2023-11-29 03:15:12,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696376148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:12,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:12,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111161405] [2023-11-29 03:15:12,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:12,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:15:12,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:12,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:15:12,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:12,708 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:12,949 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2023-11-29 03:15:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:15:12,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 03:15:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:12,951 INFO L225 Difference]: With dead ends: 101 [2023-11-29 03:15:12,951 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 03:15:12,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:12,953 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 13 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:12,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 111 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:15:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 03:15:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2023-11-29 03:15:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 96 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2023-11-29 03:15:12,961 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 4 [2023-11-29 03:15:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:12,961 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2023-11-29 03:15:12,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2023-11-29 03:15:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 03:15:12,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:12,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:12,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 03:15:13,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:13,165 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:13,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:13,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1447699891, now seen corresponding path program 1 times [2023-11-29 03:15:13,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:13,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641187428] [2023-11-29 03:15:13,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:13,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:13,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:13,167 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:13,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:13,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:15:13,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:13,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:13,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:13,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:13,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641187428] [2023-11-29 03:15:13,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641187428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:13,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:13,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:13,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572173243] [2023-11-29 03:15:13,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:13,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:15:13,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:13,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:15:13,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:13,246 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:13,409 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2023-11-29 03:15:13,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:15:13,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 03:15:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:13,411 INFO L225 Difference]: With dead ends: 93 [2023-11-29 03:15:13,411 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 03:15:13,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:13,412 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 15 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:13,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 97 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:15:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 03:15:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-29 03:15:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.7833333333333334) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2023-11-29 03:15:13,420 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 7 [2023-11-29 03:15:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:13,420 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2023-11-29 03:15:13,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2023-11-29 03:15:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 03:15:13,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:13,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:13,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:15:13,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:13,623 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:13,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:13,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1447699892, now seen corresponding path program 1 times [2023-11-29 03:15:13,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:13,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642755208] [2023-11-29 03:15:13,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:13,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:13,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:13,625 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:13,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:13,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:15:13,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:13,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:15:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:13,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:13,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:13,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642755208] [2023-11-29 03:15:13,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642755208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:13,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:13,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:13,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681877091] [2023-11-29 03:15:13,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:13,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:15:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:13,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:15:13,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:13,719 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:13,917 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2023-11-29 03:15:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:15:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 03:15:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:13,918 INFO L225 Difference]: With dead ends: 92 [2023-11-29 03:15:13,918 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 03:15:13,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:13,919 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:13,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 109 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:15:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 03:15:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-29 03:15:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 60 states have (on average 1.75) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2023-11-29 03:15:13,927 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 7 [2023-11-29 03:15:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:13,927 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2023-11-29 03:15:13,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2023-11-29 03:15:13,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 03:15:13,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:13,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:13,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:15:14,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:14,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:14,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1447698996, now seen corresponding path program 1 times [2023-11-29 03:15:14,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:14,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752207311] [2023-11-29 03:15:14,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:14,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:14,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:14,139 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:14,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 03:15:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:14,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:15:14,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:14,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:15:14,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 [2023-11-29 03:15:14,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:15:14,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:15:14,283 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:15:14,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:15:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:14,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:14,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:14,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752207311] [2023-11-29 03:15:14,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752207311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:14,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:14,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:15:14,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885473872] [2023-11-29 03:15:14,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:14,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:15:14,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:14,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:15:14,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:15:14,299 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:14,496 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2023-11-29 03:15:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:15:14,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 03:15:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:14,497 INFO L225 Difference]: With dead ends: 89 [2023-11-29 03:15:14,497 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 03:15:14,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:15:14,498 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:14,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 99 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:15:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 03:15:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-29 03:15:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.7) internal successors, (102), 88 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2023-11-29 03:15:14,505 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 7 [2023-11-29 03:15:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:14,505 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2023-11-29 03:15:14,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2023-11-29 03:15:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:15:14,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:14,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:14,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 03:15:14,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:14,707 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:14,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:14,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1656440158, now seen corresponding path program 1 times [2023-11-29 03:15:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:14,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494100072] [2023-11-29 03:15:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:14,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:14,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:14,710 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:14,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:14,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:15:14,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:14,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:14,801 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 19 treesize of output 1 [2023-11-29 03:15:14,825 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 23 treesize of output 11 [2023-11-29 03:15:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:14,835 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:14,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:14,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494100072] [2023-11-29 03:15:14,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494100072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:14,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:14,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:14,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010793875] [2023-11-29 03:15:14,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:14,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:14,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:14,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:14,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:14,837 INFO L87 Difference]: Start difference. First operand 89 states and 102 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) [2023-11-29 03:15:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:15,442 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2023-11-29 03:15:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:15,442 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 [2023-11-29 03:15:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:15,443 INFO L225 Difference]: With dead ends: 97 [2023-11-29 03:15:15,443 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 03:15:15,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:15,444 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 184 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.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:15,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 184 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:15:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 03:15:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2023-11-29 03:15:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 91 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2023-11-29 03:15:15,450 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 10 [2023-11-29 03:15:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:15,450 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2023-11-29 03:15:15,450 INFO L496 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) [2023-11-29 03:15:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2023-11-29 03:15:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:15:15,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:15,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:15,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:15,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:15,652 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:15,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:15,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1656440157, now seen corresponding path program 1 times [2023-11-29 03:15:15,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:15,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124931257] [2023-11-29 03:15:15,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:15,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:15,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:15,655 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:15,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:15,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:15:15,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:15,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:15:15,765 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 19 treesize of output 1 [2023-11-29 03:15:15,775 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 [2023-11-29 03:15:15,829 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 21 treesize of output 9 [2023-11-29 03:15:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:15,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:15,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:15,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124931257] [2023-11-29 03:15:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124931257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:15,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296124626] [2023-11-29 03:15:15,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:15,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:15,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:15,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:15,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:15,851 INFO L87 Difference]: Start difference. First operand 92 states and 107 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) [2023-11-29 03:15:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:16,283 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2023-11-29 03:15:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:16,284 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 [2023-11-29 03:15:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:16,285 INFO L225 Difference]: With dead ends: 92 [2023-11-29 03:15:16,285 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 03:15:16,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:16,286 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:16,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:15:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 03:15:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-29 03:15:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.6666666666666667) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2023-11-29 03:15:16,289 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 10 [2023-11-29 03:15:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:16,290 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2023-11-29 03:15:16,290 INFO L496 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) [2023-11-29 03:15:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2023-11-29 03:15:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:15:16,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:16,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:16,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:15:16,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:16,491 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:16,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1581900469, now seen corresponding path program 1 times [2023-11-29 03:15:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:16,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348299773] [2023-11-29 03:15:16,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:16,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:16,494 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:16,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 03:15:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:16,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:15:16,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:16,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:15:16,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:15:16,718 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:15:16,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:15:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:16,768 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:16,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348299773] [2023-11-29 03:15:16,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348299773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168395683] [2023-11-29 03:15:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:16,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:15:16,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:16,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:15:16,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:16,770 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:16,917 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2023-11-29 03:15:16,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:16,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 03:15:16,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:16,919 INFO L225 Difference]: With dead ends: 91 [2023-11-29 03:15:16,919 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 03:15:16,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:15:16,920 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 110 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:16,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 90 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:15:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 03:15:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2023-11-29 03:15:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 87 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) [2023-11-29 03:15:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2023-11-29 03:15:16,924 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 12 [2023-11-29 03:15:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:16,925 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2023-11-29 03:15:16,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2023-11-29 03:15:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 03:15:16,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:16,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:16,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 03:15:17,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:17,126 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:17,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:17,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1830401123, now seen corresponding path program 1 times [2023-11-29 03:15:17,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:17,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64199494] [2023-11-29 03:15:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:17,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:17,128 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:17,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:17,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:15:17,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:17,275 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 [2023-11-29 03:15:17,289 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 16 treesize of output 8 [2023-11-29 03:15:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:17,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:17,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:17,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64199494] [2023-11-29 03:15:17,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64199494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:17,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:17,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:15:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113402125] [2023-11-29 03:15:17,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:17,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:17,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:17,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:17,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:17,311 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 5 states, 5 states have (on average 2.6) 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) [2023-11-29 03:15:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:17,667 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2023-11-29 03:15:17,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:15:17,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) 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 [2023-11-29 03:15:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:17,669 INFO L225 Difference]: With dead ends: 150 [2023-11-29 03:15:17,669 INFO L226 Difference]: Without dead ends: 150 [2023-11-29 03:15:17,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:17,670 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 81 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:17,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 216 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:15:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-29 03:15:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 88. [2023-11-29 03:15:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 87 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) [2023-11-29 03:15:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2023-11-29 03:15:17,675 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 13 [2023-11-29 03:15:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:17,675 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2023-11-29 03:15:17,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) 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) [2023-11-29 03:15:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2023-11-29 03:15:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 03:15:17,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:17,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:17,679 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:17,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:17,877 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:17,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:17,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1830401096, now seen corresponding path program 1 times [2023-11-29 03:15:17,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:17,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344394457] [2023-11-29 03:15:17,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:17,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:17,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:17,880 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:17,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:17,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:15:17,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:17,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:15:18,071 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 15 treesize of output 1 [2023-11-29 03:15:18,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 [2023-11-29 03:15:18,122 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 17 treesize of output 9 [2023-11-29 03:15:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:18,147 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:18,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:18,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344394457] [2023-11-29 03:15:18,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344394457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:18,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:18,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:18,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218138407] [2023-11-29 03:15:18,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:18,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:18,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:18,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:18,149 INFO L87 Difference]: Start difference. First operand 88 states and 100 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) [2023-11-29 03:15:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:18,612 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2023-11-29 03:15:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:15:18,612 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 [2023-11-29 03:15:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:18,613 INFO L225 Difference]: With dead ends: 145 [2023-11-29 03:15:18,613 INFO L226 Difference]: Without dead ends: 145 [2023-11-29 03:15:18,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:18,614 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 56 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:18,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 172 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:15:18,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-29 03:15:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 94. [2023-11-29 03:15:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2023-11-29 03:15:18,618 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 13 [2023-11-29 03:15:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:18,618 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2023-11-29 03:15:18,618 INFO L496 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) [2023-11-29 03:15:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2023-11-29 03:15:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 03:15:18,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:18,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:18,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:15:18,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:18,820 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:18,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:18,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1830401095, now seen corresponding path program 1 times [2023-11-29 03:15:18,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:18,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560955557] [2023-11-29 03:15:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:18,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:18,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:18,822 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:18,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 03:15:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:18,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:15:18,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:18,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:18,985 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 15 treesize of output 1 [2023-11-29 03:15:19,008 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 11 [2023-11-29 03:15:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:19,018 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:19,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560955557] [2023-11-29 03:15:19,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560955557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:19,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:19,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41417767] [2023-11-29 03:15:19,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:19,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:19,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:19,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:19,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:19,020 INFO L87 Difference]: Start difference. First operand 94 states and 108 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) [2023-11-29 03:15:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:19,573 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2023-11-29 03:15:19,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:15:19,574 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 [2023-11-29 03:15:19,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:19,575 INFO L225 Difference]: With dead ends: 149 [2023-11-29 03:15:19,575 INFO L226 Difference]: Without dead ends: 149 [2023-11-29 03:15:19,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:19,576 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 67 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:19,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 151 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:15:19,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-29 03:15:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 94. [2023-11-29 03:15:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.606060606060606) internal successors, (106), 93 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) [2023-11-29 03:15:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2023-11-29 03:15:19,580 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 13 [2023-11-29 03:15:19,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:19,581 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2023-11-29 03:15:19,581 INFO L496 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) [2023-11-29 03:15:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2023-11-29 03:15:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 03:15:19,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:19,582 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:19,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 03:15:19,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:19,783 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:19,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2125782198, now seen corresponding path program 1 times [2023-11-29 03:15:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:19,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760107355] [2023-11-29 03:15:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:19,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:19,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:19,785 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:19,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 03:15:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:19,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:15:19,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:19,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:19,957 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:15:19,958 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 [2023-11-29 03:15:20,002 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 19 treesize of output 1 [2023-11-29 03:15:20,110 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:15:20,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:15:20,142 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 33 treesize of output 15 [2023-11-29 03:15:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:15:20,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:20,227 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_263) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:15:20,238 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_263) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:15:20,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:20,259 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 26 treesize of output 27 [2023-11-29 03:15:20,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-11-29 03:15:20,273 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 11 treesize of output 7 [2023-11-29 03:15:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 03:15:24,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:24,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760107355] [2023-11-29 03:15:24,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760107355] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:15:24,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:24,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-11-29 03:15:24,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313653298] [2023-11-29 03:15:24,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:24,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 03:15:24,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:24,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 03:15:24,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=78, Unknown=3, NotChecked=38, Total=156 [2023-11-29 03:15:24,355 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:25,015 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2023-11-29 03:15:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:15:25,016 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 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 [2023-11-29 03:15:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:25,017 INFO L225 Difference]: With dead ends: 94 [2023-11-29 03:15:25,017 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 03:15:25,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=37, Invalid=78, Unknown=3, NotChecked=38, Total=156 [2023-11-29 03:15:25,017 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 14 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:25,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 304 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 91 Unchecked, 0.6s Time] [2023-11-29 03:15:25,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 03:15:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2023-11-29 03:15:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 92 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2023-11-29 03:15:25,020 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 13 [2023-11-29 03:15:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:25,021 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2023-11-29 03:15:25,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2023-11-29 03:15:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 03:15:25,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:25,022 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:25,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 03:15:25,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:25,226 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:25,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:25,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2125782197, now seen corresponding path program 1 times [2023-11-29 03:15:25,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:25,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191541533] [2023-11-29 03:15:25,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:25,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:25,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:25,228 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:25,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:25,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 03:15:25,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:25,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:25,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:15:25,389 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:15:25,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:15:25,423 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 [2023-11-29 03:15:25,437 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 19 treesize of output 1 [2023-11-29 03:15:25,575 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:15:25,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:15:25,584 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 30 treesize of output 13 [2023-11-29 03:15:25,660 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 31 treesize of output 13 [2023-11-29 03:15:25,667 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 9 treesize of output 3 [2023-11-29 03:15:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:25,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:25,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0 .cse2) (bvadd (_ bv8 32) .cse0 .cse2)))))) is different from false [2023-11-29 03:15:25,988 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2023-11-29 03:15:26,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:26,033 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 45 treesize of output 46 [2023-11-29 03:15:26,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:26,046 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 35 treesize of output 36 [2023-11-29 03:15:26,052 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 62 treesize of output 50 [2023-11-29 03:15:26,064 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 96 treesize of output 78 [2023-11-29 03:15:26,082 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 15 treesize of output 11 [2023-11-29 03:15:26,086 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 11 treesize of output 7 [2023-11-29 03:15:26,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:26,107 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 45 treesize of output 36 [2023-11-29 03:15:26,117 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 54 treesize of output 36 [2023-11-29 03:15:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 03:15:26,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:26,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191541533] [2023-11-29 03:15:26,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191541533] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:15:26,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:26,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-11-29 03:15:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932887160] [2023-11-29 03:15:26,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:26,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 03:15:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 03:15:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=87, Unknown=2, NotChecked=38, Total=156 [2023-11-29 03:15:26,216 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:27,322 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2023-11-29 03:15:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:15:27,323 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 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 [2023-11-29 03:15:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:27,323 INFO L225 Difference]: With dead ends: 97 [2023-11-29 03:15:27,324 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 03:15:27,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=186, Unknown=2, NotChecked=58, Total=306 [2023-11-29 03:15:27,325 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 19 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:27,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 320 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 89 Unchecked, 0.9s Time] [2023-11-29 03:15:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 03:15:27,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2023-11-29 03:15:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.565217391304348) internal successors, (108), 95 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2023-11-29 03:15:27,329 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 13 [2023-11-29 03:15:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:27,329 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2023-11-29 03:15:27,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2023-11-29 03:15:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:15:27,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:27,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:27,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:27,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:27,531 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:27,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1921063850, now seen corresponding path program 1 times [2023-11-29 03:15:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:27,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377519956] [2023-11-29 03:15:27,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:27,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:27,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:27,533 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:27,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:27,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:15:27,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:27,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:27,719 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 15 treesize of output 1 [2023-11-29 03:15:27,752 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 11 [2023-11-29 03:15:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:27,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:27,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:27,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377519956] [2023-11-29 03:15:27,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377519956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:27,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:27,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:27,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922235501] [2023-11-29 03:15:27,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:27,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:27,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:27,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:27,776 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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) [2023-11-29 03:15:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:28,233 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2023-11-29 03:15:28,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:15:28,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 [2023-11-29 03:15:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:28,235 INFO L225 Difference]: With dead ends: 158 [2023-11-29 03:15:28,235 INFO L226 Difference]: Without dead ends: 158 [2023-11-29 03:15:28,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:28,235 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 103 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:28,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 146 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:15:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-29 03:15:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 96. [2023-11-29 03:15:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 95 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2023-11-29 03:15:28,240 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 15 [2023-11-29 03:15:28,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:28,240 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2023-11-29 03:15:28,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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) [2023-11-29 03:15:28,240 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2023-11-29 03:15:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:15:28,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:28,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:28,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:15:28,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:28,441 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:28,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:28,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1921063849, now seen corresponding path program 1 times [2023-11-29 03:15:28,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:28,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516635224] [2023-11-29 03:15:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:28,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:28,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:28,444 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:28,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 03:15:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:28,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:15:28,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:28,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:15:28,658 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 15 treesize of output 1 [2023-11-29 03:15:28,664 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 [2023-11-29 03:15:28,720 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 17 treesize of output 9 [2023-11-29 03:15:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:28,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:28,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:28,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516635224] [2023-11-29 03:15:28,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516635224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:28,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:28,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:28,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123880145] [2023-11-29 03:15:28,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:28,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:28,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:28,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:28,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:28,767 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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) [2023-11-29 03:15:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:29,301 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2023-11-29 03:15:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:15:29,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 [2023-11-29 03:15:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:29,303 INFO L225 Difference]: With dead ends: 144 [2023-11-29 03:15:29,303 INFO L226 Difference]: Without dead ends: 144 [2023-11-29 03:15:29,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:29,304 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 73 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:29,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 170 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:15:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-29 03:15:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2023-11-29 03:15:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 97 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2023-11-29 03:15:29,307 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 15 [2023-11-29 03:15:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:29,307 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2023-11-29 03:15:29,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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) [2023-11-29 03:15:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2023-11-29 03:15:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 03:15:29,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:29,308 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:29,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 03:15:29,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:29,510 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:29,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash 119019939, now seen corresponding path program 2 times [2023-11-29 03:15:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:29,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543747309] [2023-11-29 03:15:29,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:15:29,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:29,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:29,512 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:29,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:29,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:15:29,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:15:29,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 03:15:29,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:29,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:29,736 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:15:29,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:15:29,743 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 [2023-11-29 03:15:29,771 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 19 treesize of output 1 [2023-11-29 03:15:29,780 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 [2023-11-29 03:15:29,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:15:29,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:15:29,920 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 30 treesize of output 13 [2023-11-29 03:15:30,056 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:15:30,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:15:30,066 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 30 treesize of output 13 [2023-11-29 03:15:30,132 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 31 treesize of output 13 [2023-11-29 03:15:30,138 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 9 treesize of output 3 [2023-11-29 03:15:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:30,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:30,431 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_410) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-29 03:15:30,474 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_410) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32) .cse2) (bvadd .cse3 (_ bv8 32) .cse2))))))) is different from false [2023-11-29 03:15:30,639 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_409))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_408) .cse1 v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_410) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_408) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_409) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse4) (bvadd .cse0 .cse4 (_ bv12 32))))))) is different from false [2023-11-29 03:15:30,738 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_409))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_408) .cse2 v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_410) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_408) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_409) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse5) (bvadd .cse0 .cse5 (_ bv12 32)))))))) is different from false [2023-11-29 03:15:30,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:30,787 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 89 treesize of output 80 [2023-11-29 03:15:30,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:30,798 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 69 treesize of output 60 [2023-11-29 03:15:30,804 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 102 treesize of output 84 [2023-11-29 03:15:30,808 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 174 treesize of output 144 [2023-11-29 03:15:30,816 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 48 treesize of output 40 [2023-11-29 03:15:30,825 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 20 treesize of output 12 [2023-11-29 03:15:30,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 03:15:30,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:30,868 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 89 treesize of output 90 [2023-11-29 03:15:30,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:30,887 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 79 treesize of output 60 [2023-11-29 03:15:30,892 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:15:30,896 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 92 treesize of output 56 [2023-11-29 03:15:30,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:15:30,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:15:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-29 03:15:30,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543747309] [2023-11-29 03:15:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543747309] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:15:30,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:30,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-29 03:15:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112654174] [2023-11-29 03:15:30,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:30,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:15:30,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:30,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:15:31,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=128, Unknown=4, NotChecked=100, Total=272 [2023-11-29 03:15:31,000 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:32,703 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2023-11-29 03:15:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:15:32,704 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 03:15:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:32,705 INFO L225 Difference]: With dead ends: 102 [2023-11-29 03:15:32,705 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 03:15:32,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=308, Unknown=4, NotChecked=156, Total=552 [2023-11-29 03:15:32,706 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 21 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:32,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 468 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 312 Invalid, 0 Unknown, 190 Unchecked, 1.2s Time] [2023-11-29 03:15:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 03:15:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2023-11-29 03:15:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 100 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2023-11-29 03:15:32,710 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 16 [2023-11-29 03:15:32,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:32,711 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2023-11-29 03:15:32,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2023-11-29 03:15:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:15:32,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:32,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:32,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:15:32,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:32,912 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:32,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:32,913 INFO L85 PathProgramCache]: Analyzing trace with hash 693633776, now seen corresponding path program 1 times [2023-11-29 03:15:32,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:32,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439320453] [2023-11-29 03:15:32,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:32,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:32,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:32,915 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:32,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 03:15:33,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:33,084 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 [2023-11-29 03:15:33,092 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 [2023-11-29 03:15:33,133 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 15 treesize of output 1 [2023-11-29 03:15:33,138 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 15 treesize of output 1 [2023-11-29 03:15:33,201 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 38 treesize of output 26 [2023-11-29 03:15:33,204 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 30 treesize of output 18 [2023-11-29 03:15:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:33,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:33,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:33,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439320453] [2023-11-29 03:15:33,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439320453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:33,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:33,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:15:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694017093] [2023-11-29 03:15:33,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:33,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:15:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:33,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:15:33,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:15:33,255 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:33,918 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2023-11-29 03:15:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:15:33,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-11-29 03:15:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:33,919 INFO L225 Difference]: With dead ends: 126 [2023-11-29 03:15:33,920 INFO L226 Difference]: Without dead ends: 126 [2023-11-29 03:15:33,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:15:33,920 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:33,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 331 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:15:33,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-29 03:15:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2023-11-29 03:15:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 111 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2023-11-29 03:15:33,924 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 17 [2023-11-29 03:15:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:33,924 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2023-11-29 03:15:33,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2023-11-29 03:15:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:15:33,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:33,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:33,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:34,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:34,126 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:34,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:34,126 INFO L85 PathProgramCache]: Analyzing trace with hash 862094732, now seen corresponding path program 1 times [2023-11-29 03:15:34,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:34,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301687199] [2023-11-29 03:15:34,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:34,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:34,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:34,128 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:34,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 03:15:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:15:34,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:34,280 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 [2023-11-29 03:15:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:34,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:34,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:34,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301687199] [2023-11-29 03:15:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301687199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:34,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:34,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:34,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763741362] [2023-11-29 03:15:34,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:34,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:34,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:34,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:34,325 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:34,564 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2023-11-29 03:15:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:15:34,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:15:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:34,567 INFO L225 Difference]: With dead ends: 145 [2023-11-29 03:15:34,567 INFO L226 Difference]: Without dead ends: 145 [2023-11-29 03:15:34,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:34,568 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:34,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 178 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:15:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-29 03:15:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 124. [2023-11-29 03:15:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.5360824742268042) internal successors, (149), 123 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) [2023-11-29 03:15:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2023-11-29 03:15:34,574 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 19 [2023-11-29 03:15:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:34,574 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2023-11-29 03:15:34,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2023-11-29 03:15:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:15:34,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:34,575 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:34,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:15:34,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:34,776 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:34,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1916312501, now seen corresponding path program 3 times [2023-11-29 03:15:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:34,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238207832] [2023-11-29 03:15:34,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:15:34,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:34,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:34,778 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:34,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 03:15:35,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 03:15:35,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:15:35,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 03:15:35,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:35,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:35,224 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:15:35,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:15:35,231 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 [2023-11-29 03:15:35,257 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 19 treesize of output 1 [2023-11-29 03:15:35,263 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 [2023-11-29 03:15:35,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:15:35,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:15:35,385 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 30 treesize of output 13 [2023-11-29 03:15:35,520 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:15:35,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:15:35,531 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 30 treesize of output 13 [2023-11-29 03:15:35,663 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:15:35,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:15:35,674 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 30 treesize of output 13 [2023-11-29 03:15:35,755 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 31 treesize of output 13 [2023-11-29 03:15:35,761 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 9 treesize of output 3 [2023-11-29 03:15:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:35,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:36,052 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_535) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_535) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_534) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2023-11-29 03:15:36,100 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_535) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_535) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_534) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2023-11-29 03:15:36,291 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_533))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_532) .cse0 v_ArrVal_535) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_534) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_532) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_533) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_535) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-29 03:15:36,660 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_532) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_533) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_535) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_533))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_532) .cse4 v_ArrVal_535) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_534) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) is different from false [2023-11-29 03:15:39,524 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_531))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_530) .cse2 v_ArrVal_532) (select (select (store .cse3 .cse2 v_ArrVal_533) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_535))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_531))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_533))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_530) .cse5 v_ArrVal_532) .cse6 v_ArrVal_535) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_534) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))))) is different from false [2023-11-29 03:15:43,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_531))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_533))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv16 32) .cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_530) .cse2 v_ArrVal_532) .cse3 v_ArrVal_535) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_534) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))) (forall ((v_ArrVal_530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_531))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_530) .cse8 v_ArrVal_532) (select (select (store .cse9 .cse8 v_ArrVal_533) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_535))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv12 32) .cse7) (bvadd (_ bv16 32) .cse0 .cse7))))))) is different from false [2023-11-29 03:15:43,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:43,392 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 177 treesize of output 178 [2023-11-29 03:15:43,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:43,416 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 167 treesize of output 108 [2023-11-29 03:15:43,440 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 120144 treesize of output 103902 [2023-11-29 03:15:45,035 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 17181 treesize of output 16719 [2023-11-29 03:15:45,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 547 treesize of output 471 [2023-11-29 03:15:45,123 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 441 treesize of output 421 [2023-11-29 03:15:45,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 371 [2023-11-29 03:15:45,153 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 371 treesize of output 351 [2023-11-29 03:15:45,164 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 351 treesize of output 315 [2023-11-29 03:15:45,181 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 297 treesize of output 289 [2023-11-29 03:15:45,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:45,885 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 177 treesize of output 168 [2023-11-29 03:15:45,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:45,944 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 157 treesize of output 108 [2023-11-29 03:15:45,974 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 588 treesize of output 498 [2023-11-29 03:15:46,007 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 1230 treesize of output 1140 [2023-11-29 03:15:46,055 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 56 treesize of output 48 [2023-11-29 03:15:46,077 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 48 treesize of output 40 [2023-11-29 03:15:46,101 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 40 treesize of output 32 [2023-11-29 03:15:46,114 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 57 treesize of output 49 [2023-11-29 03:15:46,140 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 20 treesize of output 12 [2023-11-29 03:15:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-11-29 03:15:46,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:46,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238207832] [2023-11-29 03:15:46,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238207832] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:15:46,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:46,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-29 03:15:46,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472880079] [2023-11-29 03:15:46,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:46,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 03:15:46,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:46,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 03:15:46,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=177, Unknown=6, NotChecked=186, Total=420 [2023-11-29 03:15:46,424 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:50,538 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2023-11-29 03:15:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:15:50,540 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:15:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:50,541 INFO L225 Difference]: With dead ends: 127 [2023-11-29 03:15:50,541 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 03:15:50,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=108, Invalid=462, Unknown=6, NotChecked=294, Total=870 [2023-11-29 03:15:50,542 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:50,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 618 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 408 Invalid, 0 Unknown, 303 Unchecked, 2.8s Time] [2023-11-29 03:15:50,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 03:15:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-11-29 03:15:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.52) internal successors, (152), 126 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2023-11-29 03:15:50,547 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 19 [2023-11-29 03:15:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:50,547 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2023-11-29 03:15:50,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2023-11-29 03:15:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 03:15:50,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:50,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:50,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 03:15:50,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:50,749 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:50,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash 955133088, now seen corresponding path program 1 times [2023-11-29 03:15:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:50,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704722121] [2023-11-29 03:15:50,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:50,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:50,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:50,751 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:50,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 03:15:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:50,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:15:50,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:51,170 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 [2023-11-29 03:15:51,371 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 23 treesize of output 11 [2023-11-29 03:15:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:51,449 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:51,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:51,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704722121] [2023-11-29 03:15:51,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704722121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:51,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:51,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:51,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728904430] [2023-11-29 03:15:51,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:51,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:15:51,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:51,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:15:51,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:51,451 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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) [2023-11-29 03:15:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:52,557 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2023-11-29 03:15:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:15:52,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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 [2023-11-29 03:15:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:52,559 INFO L225 Difference]: With dead ends: 185 [2023-11-29 03:15:52,559 INFO L226 Difference]: Without dead ends: 185 [2023-11-29 03:15:52,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:15:52,560 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 121 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:52,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 179 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:15:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-29 03:15:52,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 128. [2023-11-29 03:15:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 127 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 153 transitions. [2023-11-29 03:15:52,566 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 153 transitions. Word has length 20 [2023-11-29 03:15:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:52,567 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 153 transitions. [2023-11-29 03:15:52,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 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) [2023-11-29 03:15:52,567 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2023-11-29 03:15:52,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:15:52,568 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:52,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:52,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:15:52,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:52,769 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:52,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -455645170, now seen corresponding path program 1 times [2023-11-29 03:15:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416796269] [2023-11-29 03:15:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:52,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:52,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:52,770 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:52,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 03:15:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:52,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:15:52,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:52,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:53,100 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 15 treesize of output 1 [2023-11-29 03:15:53,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 19 treesize of output 11 [2023-11-29 03:15:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:53,280 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:53,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:53,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416796269] [2023-11-29 03:15:53,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416796269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:53,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:53,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:53,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213337175] [2023-11-29 03:15:53,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:53,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:53,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:53,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:53,282 INFO L87 Difference]: Start difference. First operand 128 states and 153 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:54,351 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2023-11-29 03:15:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:15:54,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 03:15:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:54,354 INFO L225 Difference]: With dead ends: 184 [2023-11-29 03:15:54,354 INFO L226 Difference]: Without dead ends: 184 [2023-11-29 03:15:54,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:54,354 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 54 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:54,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 158 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:15:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-11-29 03:15:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 131. [2023-11-29 03:15:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 104 states have (on average 1.5) internal successors, (156), 130 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2023-11-29 03:15:54,359 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 21 [2023-11-29 03:15:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:54,360 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2023-11-29 03:15:54,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2023-11-29 03:15:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:15:54,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:54,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:54,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 03:15:54,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:54,561 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:54,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:54,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1709147141, now seen corresponding path program 1 times [2023-11-29 03:15:54,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:54,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189891117] [2023-11-29 03:15:54,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:54,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:54,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:54,564 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:54,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-29 03:15:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:54,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 03:15:54,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:54,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:15:55,184 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 15 treesize of output 1 [2023-11-29 03:15:55,195 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 [2023-11-29 03:15:55,351 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 15 treesize of output 1 [2023-11-29 03:15:55,361 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 15 treesize of output 1 [2023-11-29 03:15:55,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2023-11-29 03:15:55,528 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 32 treesize of output 20 [2023-11-29 03:15:55,621 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 17 treesize of output 9 [2023-11-29 03:15:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:55,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:55,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:55,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189891117] [2023-11-29 03:15:55,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189891117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:55,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:55,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:15:55,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232002389] [2023-11-29 03:15:55,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:55,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:15:55,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:15:55,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:15:55,728 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:57,942 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2023-11-29 03:15:57,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:15:57,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 03:15:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:57,944 INFO L225 Difference]: With dead ends: 167 [2023-11-29 03:15:57,944 INFO L226 Difference]: Without dead ends: 167 [2023-11-29 03:15:57,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:15:57,945 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:57,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 234 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 03:15:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-29 03:15:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2023-11-29 03:15:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 138 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 171 transitions. [2023-11-29 03:15:57,949 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 171 transitions. Word has length 21 [2023-11-29 03:15:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:57,949 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 171 transitions. [2023-11-29 03:15:57,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 171 transitions. [2023-11-29 03:15:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 03:15:57,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:57,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:57,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:58,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:58,150 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:15:58,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1709147140, now seen corresponding path program 1 times [2023-11-29 03:15:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:58,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615256285] [2023-11-29 03:15:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:58,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:15:58,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:58,152 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:15:58,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-29 03:15:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:58,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 03:15:58,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:58,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:15:58,683 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 15 treesize of output 1 [2023-11-29 03:15:58,783 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 15 treesize of output 1 [2023-11-29 03:15:58,792 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 15 treesize of output 1 [2023-11-29 03:15:58,896 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 19 [2023-11-29 03:15:58,904 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 23 treesize of output 15 [2023-11-29 03:15:58,967 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 11 [2023-11-29 03:15:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:59,034 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:59,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:59,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615256285] [2023-11-29 03:15:59,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615256285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:59,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:59,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:15:59,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007859500] [2023-11-29 03:15:59,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:59,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:15:59,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:59,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:15:59,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:15:59,036 INFO L87 Difference]: Start difference. First operand 139 states and 171 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:16:01,737 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2023-11-29 03:16:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:16:01,738 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 03:16:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:16:01,739 INFO L225 Difference]: With dead ends: 164 [2023-11-29 03:16:01,739 INFO L226 Difference]: Without dead ends: 164 [2023-11-29 03:16:01,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:16:01,740 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 88 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:16:01,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 343 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 03:16:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-29 03:16:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 145. [2023-11-29 03:16:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 144 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2023-11-29 03:16:01,744 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 21 [2023-11-29 03:16:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:16:01,744 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2023-11-29 03:16:01,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2023-11-29 03:16:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 03:16:01,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:16:01,745 INFO L195 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] [2023-11-29 03:16:01,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-11-29 03:16:01,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:01,946 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:16:01,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:16:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1240098205, now seen corresponding path program 1 times [2023-11-29 03:16:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:16:01,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703515896] [2023-11-29 03:16:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:16:01,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:01,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:16:01,948 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:16:01,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-29 03:16:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:16:02,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:16:02,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:16:02,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:16:02,200 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 03:16:02,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:16:02,475 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 [2023-11-29 03:16:02,696 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 16 treesize of output 8 [2023-11-29 03:16:02,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-29 03:16:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:16:02,816 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:16:02,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:16:02,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703515896] [2023-11-29 03:16:02,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703515896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:16:02,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:16:02,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:16:02,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457063284] [2023-11-29 03:16:02,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:16:02,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:16:02,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:16:02,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:16:02,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:16:02,818 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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) [2023-11-29 03:16:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:16:03,714 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2023-11-29 03:16:03,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:16:03,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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 [2023-11-29 03:16:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:16:03,716 INFO L225 Difference]: With dead ends: 159 [2023-11-29 03:16:03,716 INFO L226 Difference]: Without dead ends: 159 [2023-11-29 03:16:03,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:16:03,717 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 91 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:16:03,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 139 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:16:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-29 03:16:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2023-11-29 03:16:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.4916666666666667) internal successors, (179), 145 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2023-11-29 03:16:03,723 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 22 [2023-11-29 03:16:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:16:03,723 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2023-11-29 03:16:03,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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) [2023-11-29 03:16:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2023-11-29 03:16:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 03:16:03,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:16:03,724 INFO L195 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] [2023-11-29 03:16:03,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-11-29 03:16:03,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:03,925 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:16:03,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:16:03,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1240098204, now seen corresponding path program 1 times [2023-11-29 03:16:03,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:16:03,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051338305] [2023-11-29 03:16:03,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:16:03,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:03,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:16:03,927 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:16:03,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-29 03:16:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:16:04,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:16:04,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:16:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:16:04,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:16:04,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:16:04,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051338305] [2023-11-29 03:16:04,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051338305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:16:04,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:16:04,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:16:04,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832254778] [2023-11-29 03:16:04,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:16:04,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:16:04,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:16:04,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:16:04,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:16:04,275 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) [2023-11-29 03:16:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:16:04,501 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2023-11-29 03:16:04,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:16:04,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 [2023-11-29 03:16:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:16:04,503 INFO L225 Difference]: With dead ends: 141 [2023-11-29 03:16:04,503 INFO L226 Difference]: Without dead ends: 141 [2023-11-29 03:16:04,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:16:04,504 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 53 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:16:04,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 40 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:16:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-29 03:16:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2023-11-29 03:16:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 120 states have (on average 1.425) internal successors, (171), 140 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 171 transitions. [2023-11-29 03:16:04,508 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 171 transitions. Word has length 22 [2023-11-29 03:16:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:16:04,509 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 171 transitions. [2023-11-29 03:16:04,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) [2023-11-29 03:16:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 171 transitions. [2023-11-29 03:16:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 03:16:04,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:16:04,509 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:16:04,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-29 03:16:04,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:04,711 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:16:04,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:16:04,712 INFO L85 PathProgramCache]: Analyzing trace with hash -156747613, now seen corresponding path program 4 times [2023-11-29 03:16:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:16:04,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349851397] [2023-11-29 03:16:04,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 03:16:04,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:16:04,717 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:16:04,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-29 03:16:04,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 03:16:04,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:16:04,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 03:16:04,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:16:04,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:16:05,039 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:16:05,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:16:05,055 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 [2023-11-29 03:16:05,123 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 [2023-11-29 03:16:05,143 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 19 treesize of output 1 [2023-11-29 03:16:05,443 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:16:05,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:16:05,464 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 30 treesize of output 13 [2023-11-29 03:16:05,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:16:05,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:16:05,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:16:06,153 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:16:06,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:16:06,175 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 30 treesize of output 13 [2023-11-29 03:16:06,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:16:06,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:16:06,568 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 30 treesize of output 13 [2023-11-29 03:16:06,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 31 treesize of output 13 [2023-11-29 03:16:06,772 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 9 treesize of output 3 [2023-11-29 03:16:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:16:06,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:16:07,359 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_822) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-29 03:16:07,439 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_822) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2023-11-29 03:16:07,978 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_821))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_820) .cse0 v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_822) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_820) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_821) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-29 03:16:08,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_820) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_821) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_821))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_820) .cse4 v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_822) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) is different from false [2023-11-29 03:16:09,950 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_819))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_821))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_818) .cse0 v_ArrVal_820) .cse1 v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_822) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_819))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_818) .cse7 v_ArrVal_820) (select (select (store .cse8 .cse7 v_ArrVal_821) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_823))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse6 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse3)))))) is different from false [2023-11-29 03:16:11,765 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (and (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_819))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_818) .cse3 v_ArrVal_820) (select (select (store .cse4 .cse3 v_ArrVal_821) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) v_ArrVal_823))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_819))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_821))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (_ bv16 32) .cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_818) .cse6 v_ArrVal_820) .cse7 v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_822) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))))))))))) is different from false [2023-11-29 03:16:16,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_816))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_819))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_817) .cse2 v_ArrVal_818) .cse3 v_ArrVal_820) (select (select (store .cse4 .cse3 v_ArrVal_821) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) v_ArrVal_823))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_816))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_819))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_821))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd .cse0 (_ bv20 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_817) .cse7 v_ArrVal_818) .cse8 v_ArrVal_820) .cse9 v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_822) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))))))))))) is different from false [2023-11-29 03:16:21,122 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (and (forall ((v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_816))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_819))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_817) .cse3 v_ArrVal_818) .cse4 v_ArrVal_820) (select (select (store .cse5 .cse4 v_ArrVal_821) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_823))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv20 32))))) (forall ((v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_820 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_823 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_816))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_819))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_821))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_817) .cse8 v_ArrVal_818) .cse9 v_ArrVal_820) .cse10 v_ArrVal_823) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) (_ bv20 32)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_822) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))))))))))))) is different from false [2023-11-29 03:16:21,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:21,383 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 353 treesize of output 344 [2023-11-29 03:16:21,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:21,497 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 333 treesize of output 204 [2023-11-29 03:16:21,555 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 6652 treesize of output 5674 [2023-11-29 03:16:21,636 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 10174 treesize of output 9844 [2023-11-29 03:16:21,747 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 89 treesize of output 81 [2023-11-29 03:16:21,800 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 81 treesize of output 73 [2023-11-29 03:16:21,850 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 73 treesize of output 65 [2023-11-29 03:16:21,900 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 65 treesize of output 57 [2023-11-29 03:16:21,947 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 57 treesize of output 49 [2023-11-29 03:16:21,988 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 74 treesize of output 66 [2023-11-29 03:16:22,106 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 20 treesize of output 12 [2023-11-29 03:16:22,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:22,411 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 353 treesize of output 354 [2023-11-29 03:16:22,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:22,503 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 343 treesize of output 204 [2023-11-29 03:16:22,525 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:16:22,552 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 3388 treesize of output 2542 [2023-11-29 03:16:22,582 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:16:22,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:16:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2023-11-29 03:16:23,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:16:23,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349851397] [2023-11-29 03:16:23,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349851397] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:16:23,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:16:23,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-11-29 03:16:23,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505645794] [2023-11-29 03:16:23,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:16:23,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 03:16:23,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:16:23,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 03:16:23,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=234, Unknown=8, NotChecked=296, Total=600 [2023-11-29 03:16:23,380 INFO L87 Difference]: Start difference. First operand 141 states and 171 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:16:36,064 INFO L93 Difference]: Finished difference Result 144 states and 174 transitions. [2023-11-29 03:16:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 03:16:36,065 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 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 [2023-11-29 03:16:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:16:36,067 INFO L225 Difference]: With dead ends: 144 [2023-11-29 03:16:36,067 INFO L226 Difference]: Without dead ends: 144 [2023-11-29 03:16:36,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=132, Invalid=648, Unknown=8, NotChecked=472, Total=1260 [2023-11-29 03:16:36,068 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 27 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:16:36,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 550 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 315 Invalid, 0 Unknown, 388 Unchecked, 7.1s Time] [2023-11-29 03:16:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-29 03:16:36,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2023-11-29 03:16:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 143 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 174 transitions. [2023-11-29 03:16:36,073 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 174 transitions. Word has length 22 [2023-11-29 03:16:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:16:36,073 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 174 transitions. [2023-11-29 03:16:36,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2023-11-29 03:16:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:16:36,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:16:36,074 INFO L195 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, 1] [2023-11-29 03:16:36,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:16:36,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:36,274 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:16:36,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:16:36,275 INFO L85 PathProgramCache]: Analyzing trace with hash 365238099, now seen corresponding path program 1 times [2023-11-29 03:16:36,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:16:36,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624070256] [2023-11-29 03:16:36,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:16:36,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:16:36,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:16:36,276 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:16:36,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:16:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:16:36,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 03:16:36,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:16:36,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:16:37,539 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:16:37,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:16:38,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:16:39,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2023-11-29 03:16:40,531 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 22 [2023-11-29 03:16:40,773 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 [2023-11-29 03:16:41,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:16:41,505 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 15 treesize of output 1 [2023-11-29 03:16:42,833 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 62 treesize of output 42 [2023-11-29 03:16:42,878 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 46 treesize of output 30 [2023-11-29 03:16:43,450 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 [2023-11-29 03:16:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:16:44,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:16:44,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:16:44,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624070256] [2023-11-29 03:16:44,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624070256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:16:44,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:16:44,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 03:16:44,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425609386] [2023-11-29 03:16:44,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:16:44,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 03:16:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:16:44,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 03:16:44,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:16:44,905 INFO L87 Difference]: Start difference. First operand 144 states and 174 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:17:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:17:01,350 INFO L93 Difference]: Finished difference Result 170 states and 198 transitions. [2023-11-29 03:17:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:17:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-29 03:17:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:17:01,353 INFO L225 Difference]: With dead ends: 170 [2023-11-29 03:17:01,353 INFO L226 Difference]: Without dead ends: 170 [2023-11-29 03:17:01,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2023-11-29 03:17:01,354 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 140 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:17:01,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 440 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2023-11-29 03:17:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-29 03:17:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 144. [2023-11-29 03:17:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 143 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:17:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 173 transitions. [2023-11-29 03:17:01,361 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 173 transitions. Word has length 24 [2023-11-29 03:17:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:17:01,361 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 173 transitions. [2023-11-29 03:17:01,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:17:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 173 transitions. [2023-11-29 03:17:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 03:17:01,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:17:01,363 INFO L195 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, 1] [2023-11-29 03:17:01,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:17:01,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:17:01,563 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:17:01,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:17:01,563 INFO L85 PathProgramCache]: Analyzing trace with hash 365249084, now seen corresponding path program 1 times [2023-11-29 03:17:01,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:17:01,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867369654] [2023-11-29 03:17:01,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:17:01,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:17:01,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:17:01,565 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:17:01,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-29 03:17:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:01,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 03:17:01,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:17:05,212 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 [2023-11-29 03:17:05,998 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 15 treesize of output 1 [2023-11-29 03:17:06,190 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 [2023-11-29 03:17:07,320 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 38 treesize of output 22 [2023-11-29 03:17:07,370 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 11 [2023-11-29 03:17:07,967 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 15 treesize of output 7 [2023-11-29 03:17:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:17:09,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:17:09,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:17:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867369654] [2023-11-29 03:17:09,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867369654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:17:09,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:17:09,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 03:17:09,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502263785] [2023-11-29 03:17:09,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:17:09,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:17:09,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:17:09,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:17:09,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:17:09,158 INFO L87 Difference]: Start difference. First operand 144 states and 173 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:17:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:17:20,808 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2023-11-29 03:17:20,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:17:20,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-29 03:17:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:17:20,811 INFO L225 Difference]: With dead ends: 161 [2023-11-29 03:17:20,811 INFO L226 Difference]: Without dead ends: 161 [2023-11-29 03:17:20,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:17:20,812 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 159 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:17:20,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 240 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-11-29 03:17:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-29 03:17:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2023-11-29 03:17:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 123 states have (on average 1.3902439024390243) internal successors, (171), 143 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:17:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 171 transitions. [2023-11-29 03:17:20,815 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 171 transitions. Word has length 24 [2023-11-29 03:17:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:17:20,816 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 171 transitions. [2023-11-29 03:17:20,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:17:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 171 transitions. [2023-11-29 03:17:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:17:20,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:17:20,816 INFO L195 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, 1, 1] [2023-11-29 03:17:20,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-11-29 03:17:21,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:17:21,017 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:17:21,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:17:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1562520667, now seen corresponding path program 1 times [2023-11-29 03:17:21,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:17:21,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067940423] [2023-11-29 03:17:21,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:17:21,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 [2023-11-29 03:17:21,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:17:21,018 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:17:21,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-29 03:17:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:17:21,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 03:17:21,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:17:21,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:17:22,357 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:17:22,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:17:23,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:17:24,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 11 [2023-11-29 03:17:25,665 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 [2023-11-29 03:17:25,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:17:26,526 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 15 treesize of output 1 [2023-11-29 03:17:26,716 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 15 treesize of output 1 [2023-11-29 03:17:28,297 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 62 treesize of output 42 [2023-11-29 03:17:28,339 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 46 treesize of output 30 [2023-11-29 03:17:30,308 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2023-11-29 03:17:30,309 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 34 treesize of output 20 [2023-11-29 03:17:31,812 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 23 treesize of output 11 [2023-11-29 03:17:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:17:32,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:17:32,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:17:32,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067940423] [2023-11-29 03:17:32,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067940423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:17:32,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:17:32,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 03:17:32,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064664143] [2023-11-29 03:17:32,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:17:32,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 03:17:32,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:17:32,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 03:17:32,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:17:32,299 INFO L87 Difference]: Start difference. First operand 144 states and 171 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:17:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:17:53,967 INFO L93 Difference]: Finished difference Result 161 states and 185 transitions. [2023-11-29 03:17:53,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:17:53,968 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 03:17:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:17:53,969 INFO L225 Difference]: With dead ends: 161 [2023-11-29 03:17:53,969 INFO L226 Difference]: Without dead ends: 159 [2023-11-29 03:17:53,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2023-11-29 03:17:53,970 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 127 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:17:53,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 481 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2023-11-29 03:17:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-29 03:17:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2023-11-29 03:17:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.38135593220339) internal successors, (163), 138 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:17:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2023-11-29 03:17:53,976 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 25 [2023-11-29 03:17:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:17:53,976 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2023-11-29 03:17:53,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:17:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2023-11-29 03:17:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 03:17:53,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:17:53,977 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:17:53,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-11-29 03:17:54,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:17:54,178 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:17:54,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:17:54,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1035016885, now seen corresponding path program 5 times [2023-11-29 03:17:54,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:17:54,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081574148] [2023-11-29 03:17:54,179 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:17:54,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:17:54,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:17:54,180 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:17:54,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:17:54,850 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-11-29 03:17:54,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:17:54,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 03:17:54,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:17:54,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:17:55,303 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:17:55,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:17:55,398 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 [2023-11-29 03:17:55,731 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 19 treesize of output 1 [2023-11-29 03:17:55,920 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 [2023-11-29 03:17:57,458 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:17:57,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:17:57,554 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 30 treesize of output 13 [2023-11-29 03:17:59,140 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:17:59,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:17:59,188 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 30 treesize of output 13 [2023-11-29 03:18:01,039 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:18:01,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:18:01,128 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 30 treesize of output 13 [2023-11-29 03:18:03,150 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:18:03,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:18:03,295 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 30 treesize of output 13 [2023-11-29 03:18:05,399 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:18:05,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:18:05,493 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 30 treesize of output 13 [2023-11-29 03:18:06,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 31 treesize of output 13 [2023-11-29 03:18:06,714 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 9 treesize of output 3 [2023-11-29 03:18:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:18:07,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:18:15,193 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_1083))) (let ((.cse7 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (bvadd (_ bv8 32) .cse0 .cse7))) (or (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_1082))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1084) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (not (bvule .cse5 (select |c_#length| .cse2))))))) (not (bvule (bvadd (_ bv4 32) .cse0 .cse7) .cse5))))))) (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_1083))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse8 (bvadd (_ bv8 32) .cse0 .cse12))) (or (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_1082) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (not (bvule .cse8 (select |c_#length| .cse9))) (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store .cse11 .cse9 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse10) (bvadd .cse0 .cse10 (_ bv12 32)))))))) (not (bvule (bvadd (_ bv4 32) .cse0 .cse12) .cse8)))))))))) is different from false [2023-11-29 03:18:16,123 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1081))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1080) .cse7 v_ArrVal_1083))) (let ((.cse8 (select (select .cse0 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse5 (bvadd .cse3 .cse8 (_ bv12 32)))) (or (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_1082))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store .cse0 .cse1 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1084) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (not (bvule .cse5 (select |c_#length| .cse1))))))) (not (bvule (bvadd (_ bv8 32) .cse3 .cse8) .cse5))))))))) (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1081))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse13 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1080) .cse15 v_ArrVal_1083))) (let ((.cse9 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse10 (bvadd .cse3 .cse9 (_ bv12 32)))) (or (not (bvule (bvadd (_ bv8 32) .cse3 .cse9) .cse10)) (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store .cse14 .cse15 v_ArrVal_1082) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (not (bvule .cse10 (select |c_#length| .cse11))) (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store .cse13 .cse11 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse12 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse12 .cse3)))))))))))))))) is different from false [2023-11-29 03:18:17,416 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1081))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1080) .cse8 v_ArrVal_1083))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse2 (bvadd .cse0 .cse1 (_ bv12 32)))) (or (not (bvule (bvadd .cse0 (_ bv8 32) .cse1) .cse2)) (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1082))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) .cse1 (select (select (store .cse3 .cse4 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_1084) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))) (not (bvule .cse2 (select |c_#length| .cse4)))))))))))))) (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1081))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse14 (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1080) .cse16 v_ArrVal_1083))) (let ((.cse10 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse11 (bvadd .cse10 .cse1 (_ bv12 32)))) (or (not (bvule (bvadd .cse10 (_ bv8 32) .cse1) .cse11)) (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store .cse15 .cse16 v_ArrVal_1082) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse11 (select |c_#length| .cse12))) (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select (store .cse14 .cse12 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd .cse1 .cse13 (_ bv12 32)) (bvadd (_ bv16 32) .cse1 .cse13))))))))))))))))) is different from false [2023-11-29 03:18:19,612 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1078))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse6 (store .cse10 .cse9 v_ArrVal_1081))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1079) .cse9 v_ArrVal_1080) .cse7 v_ArrVal_1083))) (let ((.cse8 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (bvadd (_ bv16 32) .cse8 .cse0))) (or (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_1082))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv20 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1084) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (not (bvule .cse5 (select |c_#length| .cse2))))))) (not (bvule (bvadd .cse8 .cse0 (_ bv12 32)) .cse5))))))))))) (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1078))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse15 (store .cse19 .cse18 v_ArrVal_1081))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1079) .cse18 v_ArrVal_1080) .cse16 v_ArrVal_1083))) (let ((.cse17 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse11 (bvadd (_ bv16 32) .cse17 .cse0))) (or (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store .cse15 .cse16 v_ArrVal_1082) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (not (bvule .cse11 (select |c_#length| .cse12))) (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select (store .cse14 .cse12 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv16 32) .cse0 .cse13) (bvadd .cse0 .cse13 (_ bv20 32)))))))) (not (bvule (bvadd .cse17 .cse0 (_ bv12 32)) .cse11))))))))))))) is different from false [2023-11-29 03:18:24,164 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1078))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse6 (store .cse11 .cse10 v_ArrVal_1081))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1079) .cse10 v_ArrVal_1080) .cse7 v_ArrVal_1083))) (let ((.cse8 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse5 (bvadd (_ bv16 32) .cse0 .cse8))) (or (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse6 .cse7 v_ArrVal_1082) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store .cse2 .cse3 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (not (bvule .cse5 (select |c_#length| .cse3)))))) (not (bvule (bvadd .cse0 .cse8 (_ bv12 32)) .cse5))))))))))) (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1078))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse17 (store .cse20 .cse19 v_ArrVal_1081))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1079) .cse19 v_ArrVal_1080) .cse18 v_ArrVal_1083))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse13 (bvadd (_ bv16 32) .cse0 .cse12))) (or (not (bvule (bvadd .cse0 .cse12 (_ bv12 32)) .cse13)) (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store .cse17 .cse18 v_ArrVal_1082))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv20 32) (select (select (store .cse14 .cse15 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse16 .cse15 v_ArrVal_1084) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (not (bvule .cse13 (select |c_#length| .cse15))))))))))))))))))) is different from false [2023-11-29 03:18:29,880 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1077))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1078))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse7 (store .cse11 .cse10 v_ArrVal_1081))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse4 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1076) .cse9 v_ArrVal_1079) .cse10 v_ArrVal_1080) .cse8 v_ArrVal_1083))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse2 (bvadd .cse0 .cse1 (_ bv20 32)))) (or (not (bvule (bvadd (_ bv16 32) .cse0 .cse1) .cse2)) (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store .cse7 .cse8 v_ArrVal_1082) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse4 .cse5 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse3 (_ bv20 32)) (bvadd .cse0 .cse3 (_ bv24 32))))) (not (bvule .cse2 (select |c_#length| .cse5))))))))))))))))) (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1077))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_1078))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse18 (store .cse22 .cse21 v_ArrVal_1081))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse15 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1076) .cse20 v_ArrVal_1079) .cse21 v_ArrVal_1080) .cse19 v_ArrVal_1083))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse14 (bvadd .cse0 .cse13 (_ bv20 32)))) (or (not (bvule (bvadd (_ bv16 32) .cse0 .cse13) .cse14)) (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store .cse18 .cse19 v_ArrVal_1082))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store .cse15 .cse16 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) (_ bv24 32)) (select |c_#length| (select (select (store .cse17 .cse16 v_ArrVal_1084) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))) (not (bvule .cse14 (select |c_#length| .cse16)))))))))))))))))))) is different from false [2023-11-29 03:18:35,664 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1077))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_1078))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse7 (store .cse12 .cse11 v_ArrVal_1081))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse4 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1076) .cse10 v_ArrVal_1079) .cse11 v_ArrVal_1080) .cse8 v_ArrVal_1083))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse2 (bvadd .cse0 .cse1 (_ bv20 32)))) (or (not (bvule (bvadd (_ bv16 32) .cse0 .cse1) .cse2)) (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1082))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse1 (select (select (store .cse4 .cse3 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_1084) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))))))))))))))))))) (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1077 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| .cse9 v_ArrVal_1077))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_1078))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse18 (store .cse23 .cse22 v_ArrVal_1081))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse17 (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse9 v_ArrVal_1076) .cse21 v_ArrVal_1079) .cse22 v_ArrVal_1080) .cse19 v_ArrVal_1083))) (let ((.cse20 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse14 (bvadd .cse20 .cse1 (_ bv20 32)))) (or (forall ((v_ArrVal_1082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (select (store .cse18 .cse19 v_ArrVal_1082) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse14 (select |c_#length| .cse15))) (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (store .cse17 .cse15 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd .cse1 (_ bv20 32) .cse16) (bvadd .cse1 .cse16 (_ bv24 32)))))))) (not (bvule (bvadd (_ bv16 32) .cse20 .cse1) .cse14)))))))))))))))) is different from false [2023-11-29 03:18:36,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:18:36,342 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 1414 treesize of output 1384 [2023-11-29 03:18:36,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:18:36,471 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 1374 treesize of output 784 [2023-11-29 03:18:37,893 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 93522848 treesize of output 79769798 [2023-11-29 03:18:39,431 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 111282 treesize of output 110214 [2023-11-29 03:18:39,761 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 408 treesize of output 396 [2023-11-29 03:18:39,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 396 treesize of output 376 [2023-11-29 03:18:39,990 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 563 treesize of output 499 [2023-11-29 03:18:40,047 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 685 treesize of output 649 [2023-11-29 03:18:40,108 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 649 treesize of output 605 [2023-11-29 03:18:40,168 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 605 treesize of output 585 [2023-11-29 03:18:40,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 585 treesize of output 525 [2023-11-29 03:18:40,288 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 525 treesize of output 453 [2023-11-29 03:18:40,348 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 453 treesize of output 437 [2023-11-29 03:18:40,408 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 437 treesize of output 421 [2023-11-29 03:18:54,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:18:54,434 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 1414 treesize of output 1374 [2023-11-29 03:18:54,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:18:54,685 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 1364 treesize of output 784 [2023-11-29 03:18:54,869 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 10415322 treesize of output 8622408 [2023-11-29 03:19:06,658 WARN L293 SmtUtils]: Spent 11.78s on a formula simplification. DAG size of input: 2760 DAG size of output: 637 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:19:07,072 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 669443 treesize of output 658625 [2023-11-29 03:19:07,724 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 7457 treesize of output 6993 [2023-11-29 03:19:07,835 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 6993 treesize of output 6377 [2023-11-29 03:19:08,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 6121 treesize of output 5733 [2023-11-29 03:19:08,129 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 5989 treesize of output 5701 [2023-11-29 03:19:08,470 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 4990 treesize of output 4326 [2023-11-29 03:19:08,609 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 5037 treesize of output 4409 [2023-11-29 03:19:08,730 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 4409 treesize of output 4189 [2023-11-29 03:19:08,888 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 4189 treesize of output 4113 [2023-11-29 03:19:09,012 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 4113 treesize of output 3969 [2023-11-29 03:19:56,295 WARN L293 SmtUtils]: Spent 22.67s on a formula simplification that was a NOOP. DAG size: 451 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 03:19:56,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:19:56,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 685 treesize of output 1478 [2023-11-29 03:20:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 40 not checked. [2023-11-29 03:20:50,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:20:50,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081574148] [2023-11-29 03:20:50,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081574148] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:20:50,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:20:50,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-11-29 03:20:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82925188] [2023-11-29 03:20:50,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:20:50,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 03:20:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:20:50,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 03:20:50,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=384, Unknown=11, NotChecked=322, Total=812 [2023-11-29 03:20:50,439 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:26,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:21:27,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:21:30,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:21:30,910 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse7 (bvadd .cse6 (_ bv4 32) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse0 (bvule .cse7 (select |c_#length| .cse1))) (.cse5 (bvule (bvadd .cse6 .cse3) .cse7))) (and .cse0 (or (not .cse0) (and (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv8 32) .cse3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1084) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse4 .cse3) (bvadd .cse4 (_ bv8 32) .cse3))))) (not .cse5)) (= (bvadd (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) (_ bv1 1)) (_ bv0 1)) .cse5))))) is different from false [2023-11-29 03:21:31,605 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse7 (bvadd .cse6 (_ bv4 32) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse0 (bvule .cse7 (select |c_#length| .cse1))) (.cse5 (bvule (bvadd .cse6 .cse3) .cse7))) (and .cse0 (or (not .cse0) (and (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv8 32) .cse3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1084) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1085) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse4 .cse3) (bvadd .cse4 (_ bv8 32) .cse3))))) (not .cse5)) .cse5))))) is different from false [2023-11-29 03:21:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:42,294 INFO L93 Difference]: Finished difference Result 152 states and 178 transitions. [2023-11-29 03:21:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 03:21:42,295 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 03:21:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:42,297 INFO L225 Difference]: With dead ends: 152 [2023-11-29 03:21:42,297 INFO L226 Difference]: Without dead ends: 152 [2023-11-29 03:21:42,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 53.9s TimeCoverageRelationStatistics Valid=238, Invalid=1185, Unknown=19, NotChecked=720, Total=2162 [2023-11-29 03:21:42,299 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 496 IncrementalHoareTripleChecker+Unchecked, 36.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:42,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 788 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 638 Invalid, 4 Unknown, 496 Unchecked, 36.3s Time] [2023-11-29 03:21:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-29 03:21:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2023-11-29 03:21:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 147 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2023-11-29 03:21:42,303 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 25 [2023-11-29 03:21:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:42,303 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2023-11-29 03:21:42,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 29 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2023-11-29 03:21:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:21:42,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:42,304 INFO L195 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] [2023-11-29 03:21:42,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:21:42,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:21:42,505 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:21:42,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash 605557272, now seen corresponding path program 1 times [2023-11-29 03:21:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547974961] [2023-11-29 03:21:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:42,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:21:42,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:42,507 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:21:42,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Waiting until timeout for monitored process [2023-11-29 03:21:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:42,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 03:21:42,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:45,618 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 15 treesize of output 1 [2023-11-29 03:21:48,593 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 82 treesize of output 50 [2023-11-29 03:22:08,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:08,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:22:10,703 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 66 treesize of output 58 [2023-11-29 03:22:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:22:25,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:22:25,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547974961] [2023-11-29 03:22:25,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547974961] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:22:25,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:22:25,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-29 03:22:25,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947194544] [2023-11-29 03:22:25,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:22:25,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 03:22:25,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:22:25,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 03:22:25,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=120, Unknown=4, NotChecked=0, Total=156 [2023-11-29 03:22:25,116 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:22:30,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:22:33,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:22:43,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:22:48,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:22:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:22:53,331 INFO L93 Difference]: Finished difference Result 208 states and 238 transitions. [2023-11-29 03:22:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:22:53,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 03:22:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:22:53,334 INFO L225 Difference]: With dead ends: 208 [2023-11-29 03:22:53,334 INFO L226 Difference]: Without dead ends: 206 [2023-11-29 03:22:53,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=52, Invalid=184, Unknown=4, NotChecked=0, Total=240 [2023-11-29 03:22:53,335 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 38 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 4 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:22:53,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 364 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 374 Invalid, 16 Unknown, 0 Unchecked, 25.9s Time] [2023-11-29 03:22:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-29 03:22:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 171. [2023-11-29 03:22:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 170 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:22:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 199 transitions. [2023-11-29 03:22:53,338 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 199 transitions. Word has length 26 [2023-11-29 03:22:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:22:53,338 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 199 transitions. [2023-11-29 03:22:53,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:22:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 199 transitions. [2023-11-29 03:22:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:22:53,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:22:53,339 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:22:53,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:22:53,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:22:53,540 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:22:53,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:22:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash 605557245, now seen corresponding path program 1 times [2023-11-29 03:22:53,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:22:53,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172868553] [2023-11-29 03:22:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:22:53,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:22:53,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:22:53,542 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:22:53,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (35)] Waiting until timeout for monitored process [2023-11-29 03:22:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:22:53,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 03:22:53,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:22:55,364 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 15 treesize of output 11 [2023-11-29 03:22:55,654 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 15 treesize of output 11 [2023-11-29 03:22:56,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:22:57,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:22:57,366 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 19 treesize of output 11 [2023-11-29 03:22:57,450 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 23 treesize of output 3 [2023-11-29 03:22:59,207 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 11 treesize of output 3 [2023-11-29 03:22:59,376 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 11 treesize of output 3 [2023-11-29 03:23:01,150 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 [2023-11-29 03:23:01,274 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 19 treesize of output 11 [2023-11-29 03:23:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:23:01,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:23:06,565 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 558 treesize of output 498 [2023-11-29 03:23:06,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:23:06,954 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 70 treesize of output 40 [2023-11-29 03:23:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:23:09,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172868553] [2023-11-29 03:23:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172868553] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:23:09,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:23:09,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2023-11-29 03:23:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984978047] [2023-11-29 03:23:09,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:23:09,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 03:23:09,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:09,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 03:23:09,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:23:09,227 INFO L87 Difference]: Start difference. First operand 171 states and 199 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:17,775 INFO L93 Difference]: Finished difference Result 217 states and 248 transitions. [2023-11-29 03:23:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:23:17,777 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 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 [2023-11-29 03:23:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:17,778 INFO L225 Difference]: With dead ends: 217 [2023-11-29 03:23:17,778 INFO L226 Difference]: Without dead ends: 202 [2023-11-29 03:23:17,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-11-29 03:23:17,779 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:17,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 578 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-11-29 03:23:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-29 03:23:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 156. [2023-11-29 03:23:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 135 states have (on average 1.3555555555555556) internal successors, (183), 155 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2023-11-29 03:23:17,782 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 26 [2023-11-29 03:23:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:17,782 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2023-11-29 03:23:17,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2023-11-29 03:23:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:23:17,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:17,783 INFO L195 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, 1, 1, 1, 1] [2023-11-29 03:23:17,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (35)] Forceful destruction successful, exit code 0 [2023-11-29 03:23:17,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:23:17,983 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:23:17,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:17,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1983462602, now seen corresponding path program 1 times [2023-11-29 03:23:17,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:17,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328666996] [2023-11-29 03:23:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:17,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:23:17,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:17,985 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:23:17,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:23:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:18,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 03:23:18,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:19,090 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:23:19,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:23:20,771 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 [2023-11-29 03:23:21,286 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 15 treesize of output 1 [2023-11-29 03:23:21,331 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 15 treesize of output 1 [2023-11-29 03:23:22,221 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 24 treesize of output 16 [2023-11-29 03:23:22,267 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 20 treesize of output 12 [2023-11-29 03:23:22,676 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 16 treesize of output 8 [2023-11-29 03:23:23,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-29 03:23:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:23:23,943 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:23,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:23,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328666996] [2023-11-29 03:23:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328666996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:23,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:23,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 03:23:23,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779765520] [2023-11-29 03:23:23,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:23,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:23:23,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:23,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:23:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:23:23,945 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:32,096 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2023-11-29 03:23:32,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:23:32,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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 [2023-11-29 03:23:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:32,097 INFO L225 Difference]: With dead ends: 180 [2023-11-29 03:23:32,097 INFO L226 Difference]: Without dead ends: 180 [2023-11-29 03:23:32,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:23:32,098 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 134 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:32,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 200 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-11-29 03:23:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-29 03:23:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 158. [2023-11-29 03:23:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 157 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2023-11-29 03:23:32,102 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 27 [2023-11-29 03:23:32,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:32,103 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2023-11-29 03:23:32,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2023-11-29 03:23:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:23:32,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:32,103 INFO L195 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, 1, 1, 1] [2023-11-29 03:23:32,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:23:32,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:23:32,304 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:23:32,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash 460847267, now seen corresponding path program 1 times [2023-11-29 03:23:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835542853] [2023-11-29 03:23:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:32,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:23:32,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:32,305 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:23:32,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (37)] Waiting until timeout for monitored process [2023-11-29 03:23:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:32,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 03:23:32,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:34,384 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 [2023-11-29 03:23:34,874 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 15 treesize of output 1 [2023-11-29 03:23:34,921 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 15 treesize of output 1 [2023-11-29 03:23:35,391 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 24 treesize of output 16 [2023-11-29 03:23:35,433 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 20 treesize of output 12 [2023-11-29 03:23:35,770 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 16 treesize of output 8 [2023-11-29 03:23:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:23:36,104 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:36,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:36,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835542853] [2023-11-29 03:23:36,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835542853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:36,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:36,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 03:23:36,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270522328] [2023-11-29 03:23:36,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:36,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:23:36,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:36,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:23:36,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:23:36,106 INFO L87 Difference]: Start difference. First operand 158 states and 185 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:23:43,775 INFO L93 Difference]: Finished difference Result 175 states and 190 transitions. [2023-11-29 03:23:43,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:23:43,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 03:23:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:23:43,777 INFO L225 Difference]: With dead ends: 175 [2023-11-29 03:23:43,777 INFO L226 Difference]: Without dead ends: 175 [2023-11-29 03:23:43,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:23:43,778 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 94 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:23:43,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 375 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-11-29 03:23:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-29 03:23:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2023-11-29 03:23:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2023-11-29 03:23:43,782 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 30 [2023-11-29 03:23:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:23:43,782 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2023-11-29 03:23:43,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2023-11-29 03:23:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:23:43,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:23:43,783 INFO L195 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:23:43,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (37)] Ended with exit code 0 [2023-11-29 03:23:43,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:23:43,983 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:23:43,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:23:43,983 INFO L85 PathProgramCache]: Analyzing trace with hash -825572892, now seen corresponding path program 1 times [2023-11-29 03:23:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:23:43,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367765823] [2023-11-29 03:23:43,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:23:43,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:23:43,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:23:43,985 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:23:43,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (38)] Waiting until timeout for monitored process [2023-11-29 03:23:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:23:44,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 03:23:44,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:23:44,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:23:44,936 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:23:44,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:23:46,592 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 [2023-11-29 03:23:47,099 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 15 treesize of output 1 [2023-11-29 03:23:47,225 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 15 treesize of output 1 [2023-11-29 03:23:48,047 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 28 treesize of output 20 [2023-11-29 03:23:48,587 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 28 treesize of output 12 [2023-11-29 03:23:49,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2023-11-29 03:23:50,039 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 11 [2023-11-29 03:23:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:23:50,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:23:50,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:50,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367765823] [2023-11-29 03:23:50,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367765823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:23:50,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:23:50,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 03:23:50,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357761598] [2023-11-29 03:23:50,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:23:50,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:23:50,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:50,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:23:50,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:23:50,592 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:08,065 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2023-11-29 03:24:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 03:24:08,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 03:24:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:08,067 INFO L225 Difference]: With dead ends: 215 [2023-11-29 03:24:08,067 INFO L226 Difference]: Without dead ends: 215 [2023-11-29 03:24:08,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:24:08,068 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 121 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:24:08,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 414 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2023-11-29 03:24:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-29 03:24:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 161. [2023-11-29 03:24:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 140 states have (on average 1.3285714285714285) internal successors, (186), 160 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2023-11-29 03:24:08,072 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 30 [2023-11-29 03:24:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:08,072 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2023-11-29 03:24:08,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2023-11-29 03:24:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 03:24:08,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:08,073 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:24:08,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (38)] Ended with exit code 0 [2023-11-29 03:24:08,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:24:08,274 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:24:08,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:08,274 INFO L85 PathProgramCache]: Analyzing trace with hash 177044301, now seen corresponding path program 1 times [2023-11-29 03:24:08,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:08,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770648011] [2023-11-29 03:24:08,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:24:08,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:24:08,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:08,275 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:24:08,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (39)] Waiting until timeout for monitored process [2023-11-29 03:24:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:24:08,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:24:08,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:08,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:24:08,824 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:24:08,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:24:10,355 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 [2023-11-29 03:24:11,066 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 8 treesize of output 1 [2023-11-29 03:24:11,148 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 16 treesize of output 8 [2023-11-29 03:24:11,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-29 03:24:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:24:11,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:24:11,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:11,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770648011] [2023-11-29 03:24:11,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770648011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:24:11,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:24:11,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:24:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175107580] [2023-11-29 03:24:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:24:11,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:24:11,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:24:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:24:11,688 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:15,187 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2023-11-29 03:24:15,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:24:15,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 03:24:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:15,189 INFO L225 Difference]: With dead ends: 177 [2023-11-29 03:24:15,189 INFO L226 Difference]: Without dead ends: 177 [2023-11-29 03:24:15,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:24:15,190 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 124 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:24:15,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 158 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 03:24:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-29 03:24:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 157. [2023-11-29 03:24:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 156 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 183 transitions. [2023-11-29 03:24:15,194 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 183 transitions. Word has length 31 [2023-11-29 03:24:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:15,194 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 183 transitions. [2023-11-29 03:24:15,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 183 transitions. [2023-11-29 03:24:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 03:24:15,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:15,195 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:24:15,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (39)] Ended with exit code 0 [2023-11-29 03:24:15,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:24:15,395 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:24:15,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash 798118954, now seen corresponding path program 1 times [2023-11-29 03:24:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:15,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807921814] [2023-11-29 03:24:15,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:24:15,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:24:15,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:15,397 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:24:15,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (40)] Waiting until timeout for monitored process [2023-11-29 03:24:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:24:15,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:24:15,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:24:17,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:24:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:24:21,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:21,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807921814] [2023-11-29 03:24:21,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807921814] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:24:21,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:24:21,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-29 03:24:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802481828] [2023-11-29 03:24:21,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:24:21,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 03:24:21,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:21,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 03:24:21,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:24:21,148 INFO L87 Difference]: Start difference. First operand 157 states and 183 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:29,759 INFO L93 Difference]: Finished difference Result 178 states and 202 transitions. [2023-11-29 03:24:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:24:29,760 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 03:24:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:29,761 INFO L225 Difference]: With dead ends: 178 [2023-11-29 03:24:29,761 INFO L226 Difference]: Without dead ends: 178 [2023-11-29 03:24:29,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2023-11-29 03:24:29,762 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 37 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:24:29,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 427 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-11-29 03:24:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-29 03:24:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 173. [2023-11-29 03:24:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 172 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 202 transitions. [2023-11-29 03:24:29,766 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 202 transitions. Word has length 31 [2023-11-29 03:24:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:29,766 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 202 transitions. [2023-11-29 03:24:29,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 202 transitions. [2023-11-29 03:24:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 03:24:29,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:29,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:24:29,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (40)] Ended with exit code 0 [2023-11-29 03:24:29,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:24:29,968 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:24:29,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1117718781, now seen corresponding path program 1 times [2023-11-29 03:24:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:29,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103801712] [2023-11-29 03:24:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:24:29,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:24:29,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:29,969 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:24:29,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (41)] Waiting until timeout for monitored process [2023-11-29 03:24:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:24:30,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 03:24:30,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:31,675 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 [2023-11-29 03:24:33,383 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 15 treesize of output 11 [2023-11-29 03:24:34,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:24:34,881 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 [2023-11-29 03:24:34,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-29 03:24:35,828 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 [2023-11-29 03:24:36,479 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 24 treesize of output 8 [2023-11-29 03:24:37,691 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 [2023-11-29 03:24:37,774 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 16 treesize of output 8 [2023-11-29 03:24:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:24:38,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:24:40,289 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 66 treesize of output 62 [2023-11-29 03:24:47,543 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 374 treesize of output 338 [2023-11-29 03:24:48,075 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 42 [2023-11-29 03:24:50,141 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 30 treesize of output 26 [2023-11-29 03:24:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:24:51,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:51,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103801712] [2023-11-29 03:24:51,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103801712] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:24:51,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:24:51,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2023-11-29 03:24:51,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102320029] [2023-11-29 03:24:51,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:24:51,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 03:24:51,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:51,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 03:24:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=351, Unknown=1, NotChecked=0, Total=420 [2023-11-29 03:24:51,541 INFO L87 Difference]: Start difference. First operand 173 states and 202 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:25:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:11,168 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2023-11-29 03:25:11,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:25:11,169 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 03:25:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:11,170 INFO L225 Difference]: With dead ends: 293 [2023-11-29 03:25:11,170 INFO L226 Difference]: Without dead ends: 293 [2023-11-29 03:25:11,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=193, Invalid=798, Unknown=1, NotChecked=0, Total=992 [2023-11-29 03:25:11,171 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 204 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:11,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 797 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 13.3s Time] [2023-11-29 03:25:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-11-29 03:25:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 181. [2023-11-29 03:25:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.3125) internal successors, (210), 180 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:25:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 210 transitions. [2023-11-29 03:25:11,176 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 210 transitions. Word has length 34 [2023-11-29 03:25:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:11,176 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 210 transitions. [2023-11-29 03:25:11,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:25:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 210 transitions. [2023-11-29 03:25:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 03:25:11,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:11,177 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:25:11,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (41)] Ended with exit code 0 [2023-11-29 03:25:11,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:25:11,377 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:25:11,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1117718754, now seen corresponding path program 1 times [2023-11-29 03:25:11,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:11,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046164721] [2023-11-29 03:25:11,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:11,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:25:11,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:11,379 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:25:11,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (42)] Waiting until timeout for monitored process [2023-11-29 03:25:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:11,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 03:25:11,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:11,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:25:11,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:25:14,009 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 [2023-11-29 03:25:14,197 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 15 treesize of output 1 [2023-11-29 03:25:15,046 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 03:25:15,046 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 17 treesize of output 17 [2023-11-29 03:25:15,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 03:25:17,047 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 11 [2023-11-29 03:25:17,214 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 11 [2023-11-29 03:25:19,310 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 27 treesize of output 15 [2023-11-29 03:25:19,457 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 27 treesize of output 15 [2023-11-29 03:25:19,655 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 52 treesize of output 25 [2023-11-29 03:25:19,799 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 19 treesize of output 11 [2023-11-29 03:25:22,148 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 41 treesize of output 17 [2023-11-29 03:25:22,389 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 11 treesize of output 3 [2023-11-29 03:25:25,005 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 19 treesize of output 11 [2023-11-29 03:25:25,105 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 28 treesize of output 8 [2023-11-29 03:25:25,878 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 17 treesize of output 9 [2023-11-29 03:25:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:25:26,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:25:33,845 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 650 treesize of output 530 [2023-11-29 03:25:34,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:25:34,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:25:34,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:25:34,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:25:43,285 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 66 treesize of output 62 [2023-11-29 03:25:43,331 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 102 treesize of output 94 [2023-11-29 03:25:45,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2023-11-29 03:26:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:26:03,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:26:03,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046164721] [2023-11-29 03:26:03,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046164721] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:26:03,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:26:03,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 23 [2023-11-29 03:26:03,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776289787] [2023-11-29 03:26:03,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:26:03,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:26:03,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:26:03,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:26:03,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=470, Unknown=2, NotChecked=0, Total=552 [2023-11-29 03:26:03,392 INFO L87 Difference]: Start difference. First operand 181 states and 210 transitions. Second operand has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:36,425 INFO L93 Difference]: Finished difference Result 297 states and 331 transitions. [2023-11-29 03:26:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 03:26:36,427 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 03:26:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:36,429 INFO L225 Difference]: With dead ends: 297 [2023-11-29 03:26:36,429 INFO L226 Difference]: Without dead ends: 297 [2023-11-29 03:26:36,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 40.2s TimeCoverageRelationStatistics Valid=256, Invalid=1074, Unknown=2, NotChecked=0, Total=1332 [2023-11-29 03:26:36,430 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 305 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:36,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 703 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 22.4s Time] [2023-11-29 03:26:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-29 03:26:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 182. [2023-11-29 03:26:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 181 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 211 transitions. [2023-11-29 03:26:36,436 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 211 transitions. Word has length 34 [2023-11-29 03:26:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:36,436 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 211 transitions. [2023-11-29 03:26:36,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:26:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2023-11-29 03:26:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 03:26:36,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:36,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:26:36,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (42)] Ended with exit code 0 [2023-11-29 03:26:36,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:26:36,638 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:26:36,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1117718753, now seen corresponding path program 1 times [2023-11-29 03:26:36,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:26:36,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938665193] [2023-11-29 03:26:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:26:36,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:26:36,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:26:36,640 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:26:36,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (43)] Waiting until timeout for monitored process [2023-11-29 03:26:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:26:36,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 03:26:36,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:26:37,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:26:38,348 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 15 treesize of output 1 [2023-11-29 03:26:39,191 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2023-11-29 03:26:39,191 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 25 treesize of output 28 [2023-11-29 03:26:40,858 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 11 [2023-11-29 03:26:42,343 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 27 treesize of output 15 [2023-11-29 03:26:42,617 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 54 treesize of output 27 [2023-11-29 03:26:42,749 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 [2023-11-29 03:26:43,784 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 [2023-11-29 03:26:44,554 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 43 treesize of output 19 [2023-11-29 03:26:46,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2023-11-29 03:26:46,819 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 28 treesize of output 8 [2023-11-29 03:26:47,118 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 11 [2023-11-29 03:26:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:26:47,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:26:51,405 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 102 treesize of output 98 [2023-11-29 03:27:08,758 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 240 treesize of output 222 [2023-11-29 03:27:09,462 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 240 treesize of output 222 [2023-11-29 03:27:10,216 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 96 treesize of output 78 [2023-11-29 03:27:10,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:27:10,446 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 335 treesize of output 307 [2023-11-29 03:27:16,723 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 [2023-11-29 03:27:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:27:20,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:27:20,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938665193] [2023-11-29 03:27:20,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938665193] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:27:20,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:27:20,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2023-11-29 03:27:20,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375567197] [2023-11-29 03:27:20,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:27:20,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:27:20,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:27:20,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:27:20,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=468, Unknown=3, NotChecked=0, Total=552 [2023-11-29 03:27:20,080 INFO L87 Difference]: Start difference. First operand 182 states and 211 transitions. Second operand has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:27:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:27:50,303 INFO L93 Difference]: Finished difference Result 280 states and 319 transitions. [2023-11-29 03:27:50,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:27:50,304 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 03:27:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:27:50,306 INFO L225 Difference]: With dead ends: 280 [2023-11-29 03:27:50,306 INFO L226 Difference]: Without dead ends: 280 [2023-11-29 03:27:50,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 36.3s TimeCoverageRelationStatistics Valid=223, Invalid=1034, Unknown=3, NotChecked=0, Total=1260 [2023-11-29 03:27:50,307 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 160 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:27:50,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 749 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 22.0s Time] [2023-11-29 03:27:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-29 03:27:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 182. [2023-11-29 03:27:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 181 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:27:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2023-11-29 03:27:50,312 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 34 [2023-11-29 03:27:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:27:50,312 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2023-11-29 03:27:50,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:27:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2023-11-29 03:27:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 03:27:50,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:27:50,313 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:27:50,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (43)] Ended with exit code 0 [2023-11-29 03:27:50,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:27:50,513 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-11-29 03:27:50,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:27:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash -792807773, now seen corresponding path program 6 times [2023-11-29 03:27:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:27:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962308153] [2023-11-29 03:27:50,514 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 03:27:50,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:27:50,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:27:50,515 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:27:50,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5409597c-a73d-4a7f-a9d3-0a48ae54694f/bin/uautomizer-verify-BQ2R08f2Ya/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 (44)] Waiting until timeout for monitored process [2023-11-29 03:27:52,165 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-11-29 03:27:52,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:27:52,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 03:27:52,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:27:52,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:27:52,659 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:27:52,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:27:52,766 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 [2023-11-29 03:27:53,110 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 19 treesize of output 1 [2023-11-29 03:27:53,156 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 [2023-11-29 03:27:54,673 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:27:54,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:27:54,770 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 30 treesize of output 13 [2023-11-29 03:27:56,419 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:27:56,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:27:56,548 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 30 treesize of output 13 [2023-11-29 03:27:58,317 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:27:58,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:27:58,369 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 30 treesize of output 13 [2023-11-29 03:28:00,549 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:28:00,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:28:00,650 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 30 treesize of output 13 [2023-11-29 03:28:02,828 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:28:02,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:28:02,916 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 30 treesize of output 13 [2023-11-29 03:28:05,152 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:28:05,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:28:05,254 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 30 treesize of output 13 [2023-11-29 03:28:08,052 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:28:08,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:28:08,167 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 30 treesize of output 13 [2023-11-29 03:28:11,099 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:28:11,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:28:11,207 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 30 treesize of output 13 [2023-11-29 03:28:12,697 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 31 treesize of output 13 [2023-11-29 03:28:12,757 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 9 treesize of output 3 [2023-11-29 03:28:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:13,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:28:16,255 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-29 03:28:16,479 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32) .cse2) (bvadd .cse3 (_ bv8 32) .cse2))))))) is different from false [2023-11-29 03:28:16,843 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1834))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1833) .cse0 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1833) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-29 03:28:17,397 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1833) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1834))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1833) .cse4 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) is different from false [2023-11-29 03:28:18,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1831))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1832) .cse2 v_ArrVal_1833) (select (select (store .cse3 .cse2 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_1835))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1831))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1834))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv16 32) .cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1832) .cse5 v_ArrVal_1833) .cse6 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))))) is different from false [2023-11-29 03:28:22,323 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1831))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1832) .cse3 v_ArrVal_1833) (select (select (store .cse4 .cse3 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) v_ArrVal_1835))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1831))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1834))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (_ bv16 32) .cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1832) .cse6 v_ArrVal_1833) .cse7 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))))))))))) is different from false [2023-11-29 03:28:27,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1830))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_1831))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1834))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1829) .cse0 v_ArrVal_1832) .cse1 v_ArrVal_1833) .cse2 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4 (_ bv20 32)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1830))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1831))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1829) .cse9 v_ArrVal_1832) .cse10 v_ArrVal_1833) (select (select (store .cse11 .cse10 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_1835))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv16 32) .cse8 .cse4) (bvadd .cse8 .cse4 (_ bv20 32))))))) is different from false [2023-11-29 03:28:32,238 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1830))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1831))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1829) .cse3 v_ArrVal_1832) .cse4 v_ArrVal_1833) (select (select (store .cse5 .cse4 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_1835))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv20 32))))) (forall ((v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1830))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_1831))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1834))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1829) .cse8 v_ArrVal_1832) .cse9 v_ArrVal_1833) .cse10 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) (_ bv20 32)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))))))))))))) is different from false [2023-11-29 03:28:37,426 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1827))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_1830))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1831))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1828) .cse2 v_ArrVal_1829) .cse3 v_ArrVal_1832) .cse4 v_ArrVal_1833) (select (select (store .cse5 .cse4 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_1835))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse1 (_ bv20 32)) (bvadd .cse0 .cse1 (_ bv24 32))))) (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1827))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_1830))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_1831))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_1834))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1828) .cse9 v_ArrVal_1829) .cse10 v_ArrVal_1832) .cse11 v_ArrVal_1833) .cse12 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) (_ bv24 32)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))))))))))))) is different from false [2023-11-29 03:28:42,705 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1827))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_1830))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_1831))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_1834))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1828) .cse2 v_ArrVal_1829) .cse3 v_ArrVal_1832) .cse4 v_ArrVal_1833) .cse5 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))))))))))) (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (let ((.cse17 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1827))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_1830))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_1831))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1828) .cse12 v_ArrVal_1829) .cse13 v_ArrVal_1832) .cse14 v_ArrVal_1833) (select (select (store .cse15 .cse14 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_1835))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse0 (_ bv20 32) .cse11) (bvadd .cse0 .cse11 (_ bv24 32)))))))) is different from false [2023-11-29 03:28:47,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1825))) (let ((.cse0 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse0 v_ArrVal_1827))) (let ((.cse1 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse1 v_ArrVal_1830))) (let ((.cse2 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse2 v_ArrVal_1831))) (let ((.cse3 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse3 v_ArrVal_1834))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1826) .cse0 v_ArrVal_1828) .cse1 v_ArrVal_1829) .cse2 v_ArrVal_1832) .cse3 v_ArrVal_1833) .cse4 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) (_ bv28 32) .cse6) (select |c_#length| (select (select (store .cse7 .cse4 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))))))))))))) (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1825))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_1827))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_1830))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_1831))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1826) .cse13 v_ArrVal_1828) .cse14 v_ArrVal_1829) .cse15 v_ArrVal_1832) .cse16 v_ArrVal_1833) (select (select (store .cse17 .cse16 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) v_ArrVal_1835))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd .cse12 .cse6 (_ bv24 32)) (bvadd .cse12 (_ bv28 32) .cse6)))))) is different from false [2023-11-29 03:28:53,244 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (and (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1825))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_1827))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_1830))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_1831))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1826) .cse3 v_ArrVal_1828) .cse4 v_ArrVal_1829) .cse5 v_ArrVal_1832) .cse6 v_ArrVal_1833) (select (select (store .cse7 .cse6 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) v_ArrVal_1835))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (bvule (bvadd .cse0 .cse1 (_ bv24 32)) (bvadd (_ bv28 32) .cse0 .cse1)))) (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1825))) (let ((.cse12 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse20 (store .cse21 .cse12 v_ArrVal_1827))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_1830))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_1831))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_1834))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (bvule (bvadd (_ bv28 32) (select (select (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1826) .cse12 v_ArrVal_1828) .cse13 v_ArrVal_1829) .cse14 v_ArrVal_1832) .cse15 v_ArrVal_1833) .cse16 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) .cse1) (select |c_#length| (select (select (store .cse17 .cse16 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))))))))))))))))) is different from false [2023-11-29 03:28:58,502 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1824))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_1825))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_1827))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_1830))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_1831))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1823) .cse2 v_ArrVal_1826) .cse3 v_ArrVal_1828) .cse4 v_ArrVal_1829) .cse5 v_ArrVal_1832) .cse6 v_ArrVal_1833) (select (select (store .cse7 .cse6 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) v_ArrVal_1835))))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (bvule (bvadd .cse0 (_ bv28 32) .cse1) (bvadd .cse0 .cse1 (_ bv32 32))))) (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1824))) (let ((.cse13 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse23 (store .cse24 .cse13 v_ArrVal_1825))) (let ((.cse14 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse22 (store .cse23 .cse14 v_ArrVal_1827))) (let ((.cse15 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse21 (store .cse22 .cse15 v_ArrVal_1830))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_1831))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_1834))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1823) .cse13 v_ArrVal_1826) .cse14 v_ArrVal_1828) .cse15 v_ArrVal_1829) .cse16 v_ArrVal_1832) .cse17 v_ArrVal_1833) .cse18 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) .cse1 (_ bv32 32)) (select |c_#length| (select (select (store .cse19 .cse18 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)))))))))))))))))) is different from false [2023-11-29 03:29:03,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse8 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (and (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1824))) (let ((.cse1 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse13 (store .cse14 .cse1 v_ArrVal_1825))) (let ((.cse2 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse12 (store .cse13 .cse2 v_ArrVal_1827))) (let ((.cse3 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse11 (store .cse12 .cse3 v_ArrVal_1830))) (let ((.cse4 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse10 (store .cse11 .cse4 v_ArrVal_1831))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1834))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (bvule (bvadd (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1823) .cse1 v_ArrVal_1826) .cse2 v_ArrVal_1828) .cse3 v_ArrVal_1829) .cse4 v_ArrVal_1832) .cse5 v_ArrVal_1833) .cse6 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) .cse8 (_ bv32 32)) (select |c_#length| (select (select (store .cse9 .cse6 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)))))))))))))))) (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (select (let ((.cse25 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1824))) (let ((.cse16 (select (select .cse25 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse24 (store .cse25 .cse16 v_ArrVal_1825))) (let ((.cse17 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse23 (store .cse24 .cse17 v_ArrVal_1827))) (let ((.cse18 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse22 (store .cse23 .cse18 v_ArrVal_1830))) (let ((.cse19 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse21 (store .cse22 .cse19 v_ArrVal_1831))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1823) .cse16 v_ArrVal_1826) .cse17 v_ArrVal_1828) .cse18 v_ArrVal_1829) .cse19 v_ArrVal_1832) .cse20 v_ArrVal_1833) (select (select (store .cse21 .cse20 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) v_ArrVal_1835))))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (bvule (bvadd .cse15 (_ bv28 32) .cse8) (bvadd .cse15 .cse8 (_ bv32 32)))))))) is different from false [2023-11-29 03:29:09,100 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1821))) (let ((.cse1 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse14 (store .cse15 .cse1 v_ArrVal_1824))) (let ((.cse2 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_1825))) (let ((.cse3 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_1827))) (let ((.cse4 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_1830))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_1831))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_1834))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (bvule (bvadd (_ bv36 32) .cse0 (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1822) .cse1 v_ArrVal_1823) .cse2 v_ArrVal_1826) .cse3 v_ArrVal_1828) .cse4 v_ArrVal_1829) .cse5 v_ArrVal_1832) .cse6 v_ArrVal_1833) .cse7 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)))))))))))))))))) (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (select (select (let ((.cse28 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1821))) (let ((.cse17 (select (select .cse28 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse27 (store .cse28 .cse17 v_ArrVal_1824))) (let ((.cse18 (select (select .cse27 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse26 (store .cse27 .cse18 v_ArrVal_1825))) (let ((.cse19 (select (select .cse26 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse25 (store .cse26 .cse19 v_ArrVal_1827))) (let ((.cse20 (select (select .cse25 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse24 (store .cse25 .cse20 v_ArrVal_1830))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_1831))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1822) .cse17 v_ArrVal_1823) .cse18 v_ArrVal_1826) .cse19 v_ArrVal_1828) .cse20 v_ArrVal_1829) .cse21 v_ArrVal_1832) .cse22 v_ArrVal_1833) (select (select (store .cse23 .cse22 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) v_ArrVal_1835))))))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (bvule (bvadd .cse0 .cse16 (_ bv32 32)) (bvadd (_ bv36 32) .cse0 .cse16)))))) is different from false [2023-11-29 03:29:13,975 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (and (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1821))) (let ((.cse2 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse15 (store .cse16 .cse2 v_ArrVal_1824))) (let ((.cse3 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse14 (store .cse15 .cse3 v_ArrVal_1825))) (let ((.cse4 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse13 (store .cse14 .cse4 v_ArrVal_1827))) (let ((.cse5 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse12 (store .cse13 .cse5 v_ArrVal_1830))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_1831))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_1834))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (bvule (bvadd (_ bv36 32) .cse0 (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1822) .cse2 v_ArrVal_1823) .cse3 v_ArrVal_1826) .cse4 v_ArrVal_1828) .cse5 v_ArrVal_1829) .cse6 v_ArrVal_1832) .cse7 v_ArrVal_1833) .cse8 v_ArrVal_1835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_1836) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9)))))))))))))))))) (forall ((v_ArrVal_1827 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select (select (let ((.cse29 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1821))) (let ((.cse18 (select (select .cse29 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse28 (store .cse29 .cse18 v_ArrVal_1824))) (let ((.cse19 (select (select .cse28 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse27 (store .cse28 .cse19 v_ArrVal_1825))) (let ((.cse20 (select (select .cse27 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse26 (store .cse27 .cse20 v_ArrVal_1827))) (let ((.cse21 (select (select .cse26 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_1830))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_1831))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (store (store (store (store (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1822) .cse18 v_ArrVal_1823) .cse19 v_ArrVal_1826) .cse20 v_ArrVal_1828) .cse21 v_ArrVal_1829) .cse22 v_ArrVal_1832) .cse23 v_ArrVal_1833) (select (select (store .cse24 .cse23 v_ArrVal_1834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9) v_ArrVal_1835))))))))))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (bvule (bvadd .cse0 .cse17 (_ bv32 32)) (bvadd (_ bv36 32) .cse0 .cse17))))))) is different from false [2023-11-29 03:29:15,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:29:15,689 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 5633 treesize of output 5624 [2023-11-29 03:29:15,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:29:15,821 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 5613 treesize of output 3084