./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.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_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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_0f49b80f-89b3-4443-8914-935372d39b40/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 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:24:39,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:24:39,403 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:24:39,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:24:39,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:24:39,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:24:39,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:24:39,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:24:39,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:24:39,436 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:24:39,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:24:39,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:24:39,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:24:39,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:24:39,439 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:24:39,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:24:39,440 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:24:39,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:24:39,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:24:39,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:24:39,442 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:24:39,443 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:24:39,443 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:24:39,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:24:39,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:24:39,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:24:39,445 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:24:39,446 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:24:39,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:24:39,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:24:39,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:24:39,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:24:39,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:24:39,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:24:39,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:24:39,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:24:39,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:24:39,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:24:39,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:24:39,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:24:39,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:24:39,450 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_0f49b80f-89b3-4443-8914-935372d39b40/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_0f49b80f-89b3-4443-8914-935372d39b40/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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2023-11-29 03:24:39,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:24:39,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:24:39,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:24:39,697 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:24:39,698 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:24:39,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2023-11-29 03:24:42,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:24:42,625 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:24:42,625 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2023-11-29 03:24:42,642 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/data/f8f7ca4fc/11a43b4742484feda2316258e2260868/FLAG959502524 [2023-11-29 03:24:42,652 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/data/f8f7ca4fc/11a43b4742484feda2316258e2260868 [2023-11-29 03:24:42,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:24:42,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:24:42,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:24:42,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:24:42,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:24:42,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:24:42" (1/1) ... [2023-11-29 03:24:42,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b83eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:42, skipping insertion in model container [2023-11-29 03:24:42,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:24:42" (1/1) ... [2023-11-29 03:24:42,720 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:24:43,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:24:43,164 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:24:43,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4155be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:43, skipping insertion in model container [2023-11-29 03:24:43,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:24:43,165 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 03:24:43,167 INFO L158 Benchmark]: Toolchain (without parser) took 510.70ms. Allocated memory is still 163.6MB. Free memory was 113.1MB in the beginning and 93.6MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 03:24:43,168 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:24:43,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.76ms. Allocated memory is still 163.6MB. Free memory was 113.1MB in the beginning and 94.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 03:24:43,170 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.18ms. Allocated memory is still 163.6MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.76ms. Allocated memory is still 163.6MB. Free memory was 113.1MB in the beginning and 94.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 716]: 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_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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_0f49b80f-89b3-4443-8914-935372d39b40/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 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:24:44,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:24:44,967 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 03:24:44,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:24:44,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:24:45,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:24:45,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:24:45,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:24:45,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:24:45,008 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:24:45,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:24:45,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:24:45,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:24:45,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:24:45,011 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:24:45,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:24:45,012 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:24:45,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:24:45,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:24:45,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:24:45,014 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:24:45,015 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:24:45,015 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:24:45,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:24:45,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:24:45,017 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:24:45,017 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:24:45,017 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:24:45,018 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:24:45,019 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:24:45,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:24:45,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:24:45,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:24:45,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:24:45,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:24:45,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:24:45,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:24:45,021 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:24:45,021 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:24:45,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:24:45,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:24:45,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:24:45,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:24:45,022 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:24:45,022 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_0f49b80f-89b3-4443-8914-935372d39b40/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_0f49b80f-89b3-4443-8914-935372d39b40/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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2023-11-29 03:24:45,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:24:45,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:24:45,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:24:45,317 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:24:45,317 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:24:45,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2023-11-29 03:24:48,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:24:48,335 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:24:48,336 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2023-11-29 03:24:48,353 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/data/dc24c9207/b2f6f6a3309d41dbbd3557a8ca91e0e0/FLAGe46cdef67 [2023-11-29 03:24:48,368 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/data/dc24c9207/b2f6f6a3309d41dbbd3557a8ca91e0e0 [2023-11-29 03:24:48,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:24:48,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:24:48,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:24:48,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:24:48,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:24:48,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:24:48" (1/1) ... [2023-11-29 03:24:48,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db85d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:48, skipping insertion in model container [2023-11-29 03:24:48,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:24:48" (1/1) ... [2023-11-29 03:24:48,467 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:24:48,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:24:48,937 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 03:24:48,960 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:24:49,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:24:49,038 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:24:49,110 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:24:49,147 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:24:49,154 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:24:49,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49 WrapperNode [2023-11-29 03:24:49,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:24:49,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:24:49,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:24:49,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:24:49,164 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:24:49" (1/1) ... [2023-11-29 03:24:49,193 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:24:49" (1/1) ... [2023-11-29 03:24:49,243 INFO L138 Inliner]: procedures = 179, calls = 280, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1017 [2023-11-29 03:24:49,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:24:49,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:24:49,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:24:49,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:24:49,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49" (1/1) ... [2023-11-29 03:24:49,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49" (1/1) ... [2023-11-29 03:24:49,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49" (1/1) ... [2023-11-29 03:24:49,338 INFO L175 MemorySlicer]: Split 258 memory accesses to 4 slices as follows [2, 5, 217, 34]. 84 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 1, 50, 4]. [2023-11-29 03:24:49,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49" (1/1) ... [2023-11-29 03:24:49,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49" (1/1) ... [2023-11-29 03:24:49,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49" (1/1) ... [2023-11-29 03:24:49,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49" (1/1) ... [2023-11-29 03:24:49,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49" (1/1) ... [2023-11-29 03:24:49,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49" (1/1) ... [2023-11-29 03:24:49,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:24:49,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:24:49,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:24:49,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:24:49,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49" (1/1) ... [2023-11-29 03:24:49,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:24:49,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:24:49,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:24:49,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:24:49,513 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 03:24:49,514 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 03:24:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 03:24:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 03:24:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 03:24:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 03:24:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 03:24:49,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 03:24:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 03:24:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 03:24:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 03:24:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 03:24:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 03:24:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 03:24:49,515 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 03:24:49,516 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 03:24:49,516 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 03:24:49,516 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 03:24:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:24:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:24:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:24:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:24:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:24:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 03:24:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:24:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 03:24:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:24:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:24:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:24:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 03:24:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:24:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:24:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:24:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 03:24:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 03:24:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:24:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:24:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 03:24:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 03:24:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:24:49,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:24:49,724 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:24:49,726 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:24:49,749 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:24:49,780 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:24:49,801 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:24:49,822 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:24:53,936 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:24:54,105 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:24:54,105 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-11-29 03:24:54,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:24:54 BoogieIcfgContainer [2023-11-29 03:24:54,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:24:54,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:24:54,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:24:54,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:24:54,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:24:48" (1/3) ... [2023-11-29 03:24:54,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea47d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:24:54, skipping insertion in model container [2023-11-29 03:24:54,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:24:49" (2/3) ... [2023-11-29 03:24:54,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea47d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:24:54, skipping insertion in model container [2023-11-29 03:24:54,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:24:54" (3/3) ... [2023-11-29 03:24:54,115 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-1.i [2023-11-29 03:24:54,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:24:54,133 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2023-11-29 03:24:54,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:24:54,202 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;@28a3ee88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:24:54,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2023-11-29 03:24:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 956 states, 422 states have (on average 2.537914691943128) internal successors, (1071), 949 states have internal predecessors, (1071), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 03:24:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:24:54,216 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:54,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:24:54,217 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:24:54,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash 54702, now seen corresponding path program 1 times [2023-11-29 03:24:54,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:54,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083641790] [2023-11-29 03:24:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:24:54,234 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:54,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:54,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:54,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:24:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:24:54,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:24:54,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:54,477 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:54,487 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:54,487 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:24:54,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083641790] [2023-11-29 03:24:54,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083641790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:24:54,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:24:54,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:24:54,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691198575] [2023-11-29 03:24:54,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:24:54,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:24:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:54,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:24:54,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:24:54,519 INFO L87 Difference]: Start difference. First operand has 956 states, 422 states have (on average 2.537914691943128) internal successors, (1071), 949 states have internal predecessors, (1071), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:56,144 INFO L93 Difference]: Finished difference Result 950 states and 1005 transitions. [2023-11-29 03:24:56,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:24:56,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 03:24:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:56,161 INFO L225 Difference]: With dead ends: 950 [2023-11-29 03:24:56,161 INFO L226 Difference]: Without dead ends: 949 [2023-11-29 03:24:56,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:24:56,165 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 881 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:24:56,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 561 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 03:24:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2023-11-29 03:24:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 940. [2023-11-29 03:24:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 424 states have (on average 2.330188679245283) internal successors, (988), 934 states have internal predecessors, (988), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:24:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 996 transitions. [2023-11-29 03:24:56,260 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 996 transitions. Word has length 2 [2023-11-29 03:24:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:56,261 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 996 transitions. [2023-11-29 03:24:56,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 996 transitions. [2023-11-29 03:24:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:24:56,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:56,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:24:56,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:24:56,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:56,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:24:56,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash 54703, now seen corresponding path program 1 times [2023-11-29 03:24:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254732323] [2023-11-29 03:24:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:24:56,465 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:56,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:56,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:56,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:24:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:24:56,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:24:56,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:56,570 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:24:56,581 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:56,581 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:24:56,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:24:56,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254732323] [2023-11-29 03:24:56,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254732323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:24:56,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:24:56,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:24:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923630656] [2023-11-29 03:24:56,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:24:56,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:24:56,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:24:56,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:24:56,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:24:56,585 INFO L87 Difference]: Start difference. First operand 940 states and 996 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:24:59,558 INFO L93 Difference]: Finished difference Result 1296 states and 1383 transitions. [2023-11-29 03:24:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:24:59,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 03:24:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:24:59,564 INFO L225 Difference]: With dead ends: 1296 [2023-11-29 03:24:59,565 INFO L226 Difference]: Without dead ends: 1296 [2023-11-29 03:24:59,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:24:59,566 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 385 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:24:59,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1208 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 03:24:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2023-11-29 03:24:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1109. [2023-11-29 03:24:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 594 states have (on average 2.3047138047138045) internal successors, (1369), 1103 states have internal predecessors, (1369), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:24:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1377 transitions. [2023-11-29 03:24:59,603 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1377 transitions. Word has length 2 [2023-11-29 03:24:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:24:59,603 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1377 transitions. [2023-11-29 03:24:59,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:24:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1377 transitions. [2023-11-29 03:24:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:24:59,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:24:59,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:24:59,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:24:59,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:59,811 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:24:59,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:24:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1020415880, now seen corresponding path program 1 times [2023-11-29 03:24:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:24:59,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341283691] [2023-11-29 03:24:59,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:24:59,813 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:59,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:24:59,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:59,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:24:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:24:59,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:24:59,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:24:59,969 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:24:59,976 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:00,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:25:00,042 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:25:00,062 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:25:00,062 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:25:00,082 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:25:00,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:00,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:00,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341283691] [2023-11-29 03:25:00,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341283691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:00,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:00,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:25:00,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678704929] [2023-11-29 03:25:00,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:00,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:25:00,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:00,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:25:00,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:25:00,085 INFO L87 Difference]: Start difference. First operand 1109 states and 1377 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:02,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:02,653 INFO L93 Difference]: Finished difference Result 1112 states and 1382 transitions. [2023-11-29 03:25:02,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:25:02,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 03:25:02,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:02,660 INFO L225 Difference]: With dead ends: 1112 [2023-11-29 03:25:02,660 INFO L226 Difference]: Without dead ends: 1112 [2023-11-29 03:25:02,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:25:02,662 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 966 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:02,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 282 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 03:25:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2023-11-29 03:25:02,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 929. [2023-11-29 03:25:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 424 states have (on average 2.30188679245283) internal successors, (976), 923 states have internal predecessors, (976), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 984 transitions. [2023-11-29 03:25:02,687 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 984 transitions. Word has length 6 [2023-11-29 03:25:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:02,688 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 984 transitions. [2023-11-29 03:25:02,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 984 transitions. [2023-11-29 03:25:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 03:25:02,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:02,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:25:02,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:02,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:02,891 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:02,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1568121198, now seen corresponding path program 1 times [2023-11-29 03:25:02,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:02,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583829415] [2023-11-29 03:25:02,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:02,892 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:02,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:02,893 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:02,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:03,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:25:03,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:03,007 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:03,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:25:03,018 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:03,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583829415] [2023-11-29 03:25:03,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583829415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:03,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:03,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:25:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222730416] [2023-11-29 03:25:03,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:03,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:25:03,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:03,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:25:03,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:25:03,020 INFO L87 Difference]: Start difference. First operand 929 states and 984 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:25:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:05,029 INFO L93 Difference]: Finished difference Result 1225 states and 1310 transitions. [2023-11-29 03:25:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:25:05,031 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:25:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:05,036 INFO L225 Difference]: With dead ends: 1225 [2023-11-29 03:25:05,036 INFO L226 Difference]: Without dead ends: 1225 [2023-11-29 03:25:05,036 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:25:05,037 INFO L413 NwaCegarLoop]: 761 mSDtfsCounter, 881 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:05,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 971 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 03:25:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2023-11-29 03:25:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 882. [2023-11-29 03:25:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 424 states have (on average 2.1910377358490565) internal successors, (929), 876 states have internal predecessors, (929), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 937 transitions. [2023-11-29 03:25:05,058 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 937 transitions. Word has length 7 [2023-11-29 03:25:05,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:05,059 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 937 transitions. [2023-11-29 03:25:05,059 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:25:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 937 transitions. [2023-11-29 03:25:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 03:25:05,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:05,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:25:05,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:05,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:05,263 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:05,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1568121197, now seen corresponding path program 1 times [2023-11-29 03:25:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:05,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481588614] [2023-11-29 03:25:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:05,264 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:05,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:05,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:05,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:05,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:25:05,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:05,367 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:05,391 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:25:05,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:05,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481588614] [2023-11-29 03:25:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481588614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:05,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:25:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155502640] [2023-11-29 03:25:05,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:05,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:25:05,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:05,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:25:05,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:25:05,394 INFO L87 Difference]: Start difference. First operand 882 states and 937 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:25:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:08,116 INFO L93 Difference]: Finished difference Result 1295 states and 1383 transitions. [2023-11-29 03:25:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:25:08,117 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:25:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:08,123 INFO L225 Difference]: With dead ends: 1295 [2023-11-29 03:25:08,123 INFO L226 Difference]: Without dead ends: 1295 [2023-11-29 03:25:08,123 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:25:08,124 INFO L413 NwaCegarLoop]: 932 mSDtfsCounter, 613 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:08,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1272 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 03:25:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2023-11-29 03:25:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 895. [2023-11-29 03:25:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 447 states have (on average 2.1834451901565997) internal successors, (976), 889 states have internal predecessors, (976), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 984 transitions. [2023-11-29 03:25:08,148 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 984 transitions. Word has length 7 [2023-11-29 03:25:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:08,148 INFO L495 AbstractCegarLoop]: Abstraction has 895 states and 984 transitions. [2023-11-29 03:25:08,149 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:25:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 984 transitions. [2023-11-29 03:25:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 03:25:08,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:08,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:25:08,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:08,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:08,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:08,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash 4917671, now seen corresponding path program 1 times [2023-11-29 03:25:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:08,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205485952] [2023-11-29 03:25:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:08,353 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:08,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:08,354 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:08,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:08,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:25:08,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:08,496 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:25:08,497 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:25:08,497 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:25:08,502 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 30 treesize of output 39 [2023-11-29 03:25:08,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:25:08,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-11-29 03:25:08,569 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:25:08,569 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:08,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205485952] [2023-11-29 03:25:08,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205485952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:08,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:08,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:25:08,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196148119] [2023-11-29 03:25:08,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:08,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:25:08,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:08,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:25:08,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:25:08,572 INFO L87 Difference]: Start difference. First operand 895 states and 984 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:25:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:10,386 INFO L93 Difference]: Finished difference Result 1779 states and 1958 transitions. [2023-11-29 03:25:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:25:10,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 03:25:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:10,394 INFO L225 Difference]: With dead ends: 1779 [2023-11-29 03:25:10,394 INFO L226 Difference]: Without dead ends: 1779 [2023-11-29 03:25:10,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:25:10,395 INFO L413 NwaCegarLoop]: 797 mSDtfsCounter, 898 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:10,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 2384 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 03:25:10,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2023-11-29 03:25:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 897. [2023-11-29 03:25:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 449 states have (on average 2.178173719376392) internal successors, (978), 891 states have internal predecessors, (978), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 986 transitions. [2023-11-29 03:25:10,415 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 986 transitions. Word has length 11 [2023-11-29 03:25:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:10,415 INFO L495 AbstractCegarLoop]: Abstraction has 897 states and 986 transitions. [2023-11-29 03:25:10,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:25:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 986 transitions. [2023-11-29 03:25:10,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:25:10,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:10,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:25:10,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:25:10,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:10,617 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:10,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:10,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1709168535, now seen corresponding path program 1 times [2023-11-29 03:25:10,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:10,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127724360] [2023-11-29 03:25:10,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:10,618 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:10,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:10,619 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:10,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:10,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:25:10,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:10,772 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:25:10,772 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:10,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:10,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127724360] [2023-11-29 03:25:10,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127724360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:10,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:10,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:25:10,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692484779] [2023-11-29 03:25:10,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:10,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:25:10,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:10,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:25:10,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:25:10,774 INFO L87 Difference]: Start difference. First operand 897 states and 986 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:25:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:11,423 INFO L93 Difference]: Finished difference Result 858 states and 946 transitions. [2023-11-29 03:25:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:25:11,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:25:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:11,428 INFO L225 Difference]: With dead ends: 858 [2023-11-29 03:25:11,428 INFO L226 Difference]: Without dead ends: 858 [2023-11-29 03:25:11,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:25:11,429 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 70 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:11,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1485 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:25:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2023-11-29 03:25:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2023-11-29 03:25:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 434 states have (on average 2.161290322580645) internal successors, (938), 852 states have internal predecessors, (938), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 946 transitions. [2023-11-29 03:25:11,453 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 946 transitions. Word has length 15 [2023-11-29 03:25:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:11,453 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 946 transitions. [2023-11-29 03:25:11,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:25:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 946 transitions. [2023-11-29 03:25:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:25:11,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:11,454 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:25:11,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:11,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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,655 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:11,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1833457533, now seen corresponding path program 1 times [2023-11-29 03:25:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168637508] [2023-11-29 03:25:11,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:11,656 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,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:11,657 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:11,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:25:11,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:11,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:25:11,816 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:11,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:11,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168637508] [2023-11-29 03:25:11,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168637508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:11,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:11,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:25:11,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834900741] [2023-11-29 03:25:11,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:11,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:25:11,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:11,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:25:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:25:11,818 INFO L87 Difference]: Start difference. First operand 858 states and 946 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:25:12,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:12,689 INFO L93 Difference]: Finished difference Result 844 states and 925 transitions. [2023-11-29 03:25:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:25:12,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:25:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:12,694 INFO L225 Difference]: With dead ends: 844 [2023-11-29 03:25:12,694 INFO L226 Difference]: Without dead ends: 844 [2023-11-29 03:25:12,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:25:12,695 INFO L413 NwaCegarLoop]: 736 mSDtfsCounter, 58 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:12,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2184 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:25:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2023-11-29 03:25:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 843. [2023-11-29 03:25:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 433 states have (on average 2.115473441108545) internal successors, (916), 837 states have internal predecessors, (916), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 924 transitions. [2023-11-29 03:25:12,712 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 924 transitions. Word has length 17 [2023-11-29 03:25:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:12,712 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 924 transitions. [2023-11-29 03:25:12,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:25:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 924 transitions. [2023-11-29 03:25:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 03:25:12,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:12,713 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:25:12,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:25:12,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:12,914 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:12,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash 308594481, now seen corresponding path program 1 times [2023-11-29 03:25:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:12,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673737604] [2023-11-29 03:25:12,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:12,915 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:12,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:12,916 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:12,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:13,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:25:13,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:13,086 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:13,157 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:25:13,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:13,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673737604] [2023-11-29 03:25:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673737604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:13,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:25:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577398355] [2023-11-29 03:25:13,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:13,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:25:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:13,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:25:13,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:25:13,160 INFO L87 Difference]: Start difference. First operand 843 states and 924 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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:25:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:15,498 INFO L93 Difference]: Finished difference Result 1182 states and 1293 transitions. [2023-11-29 03:25:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:25:15,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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:25:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:15,506 INFO L225 Difference]: With dead ends: 1182 [2023-11-29 03:25:15,506 INFO L226 Difference]: Without dead ends: 1182 [2023-11-29 03:25:15,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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:25:15,507 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 814 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:15,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 956 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 03:25:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2023-11-29 03:25:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 839. [2023-11-29 03:25:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 433 states have (on average 2.1062355658198615) internal successors, (912), 833 states have internal predecessors, (912), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 920 transitions. [2023-11-29 03:25:15,526 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 920 transitions. Word has length 31 [2023-11-29 03:25:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:15,526 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 920 transitions. [2023-11-29 03:25:15,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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:25:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 920 transitions. [2023-11-29 03:25:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 03:25:15,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:15,527 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:25:15,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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)] Ended with exit code 0 [2023-11-29 03:25:15,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:15,728 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:15,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:15,728 INFO L85 PathProgramCache]: Analyzing trace with hash 308594482, now seen corresponding path program 1 times [2023-11-29 03:25:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390341480] [2023-11-29 03:25:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:15,729 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:15,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:15,730 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:15,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:15,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:25:15,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:15,901 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:16,086 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:25:16,086 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:16,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:16,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390341480] [2023-11-29 03:25:16,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390341480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:16,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:16,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:25:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762657394] [2023-11-29 03:25:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:16,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:25:16,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:25:16,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:25:16,088 INFO L87 Difference]: Start difference. First operand 839 states and 920 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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:25:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:19,204 INFO L93 Difference]: Finished difference Result 1235 states and 1315 transitions. [2023-11-29 03:25:19,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:25:19,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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:25:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:19,210 INFO L225 Difference]: With dead ends: 1235 [2023-11-29 03:25:19,210 INFO L226 Difference]: Without dead ends: 1235 [2023-11-29 03:25:19,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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:25:19,210 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 548 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:19,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1253 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 03:25:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2023-11-29 03:25:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 835. [2023-11-29 03:25:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 433 states have (on average 2.096997690531178) internal successors, (908), 829 states have internal predecessors, (908), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 916 transitions. [2023-11-29 03:25:19,228 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 916 transitions. Word has length 31 [2023-11-29 03:25:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:19,229 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 916 transitions. [2023-11-29 03:25:19,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 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:25:19,229 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 916 transitions. [2023-11-29 03:25:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 03:25:19,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:19,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:25:19,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:19,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:19,432 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:19,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:19,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1210445483, now seen corresponding path program 1 times [2023-11-29 03:25:19,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:19,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477602514] [2023-11-29 03:25:19,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:19,433 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:19,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:19,434 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:19,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:19,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:25:19,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:19,691 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:25:19,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:19,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477602514] [2023-11-29 03:25:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477602514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:19,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:19,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:25:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892223643] [2023-11-29 03:25:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:19,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:25:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:19,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:25:19,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:25:19,693 INFO L87 Difference]: Start difference. First operand 835 states and 916 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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:20,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:20,519 INFO L93 Difference]: Finished difference Result 829 states and 906 transitions. [2023-11-29 03:25:20,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:25:20,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-29 03:25:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:20,525 INFO L225 Difference]: With dead ends: 829 [2023-11-29 03:25:20,525 INFO L226 Difference]: Without dead ends: 829 [2023-11-29 03:25:20,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:25:20,526 INFO L413 NwaCegarLoop]: 730 mSDtfsCounter, 23 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:20,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2170 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:25:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2023-11-29 03:25:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2023-11-29 03:25:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 427 states have (on average 2.1030444964871196) internal successors, (898), 823 states have internal predecessors, (898), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 906 transitions. [2023-11-29 03:25:20,538 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 906 transitions. Word has length 47 [2023-11-29 03:25:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:20,539 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 906 transitions. [2023-11-29 03:25:20,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 906 transitions. [2023-11-29 03:25:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 03:25:20,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:20,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:25:20,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:20,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:20,744 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:20,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:20,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1449506260, now seen corresponding path program 1 times [2023-11-29 03:25:20,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:20,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474467759] [2023-11-29 03:25:20,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:20,745 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:20,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:20,746 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:20,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:20,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:25:20,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:21,161 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:25:21,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:21,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:21,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474467759] [2023-11-29 03:25:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474467759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:21,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:21,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:25:21,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230851587] [2023-11-29 03:25:21,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:21,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:25:21,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:21,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:25:21,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:25:21,163 INFO L87 Difference]: Start difference. First operand 829 states and 906 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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:25:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:22,189 INFO L93 Difference]: Finished difference Result 1167 states and 1266 transitions. [2023-11-29 03:25:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:25:22,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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 51 [2023-11-29 03:25:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:22,194 INFO L225 Difference]: With dead ends: 1167 [2023-11-29 03:25:22,194 INFO L226 Difference]: Without dead ends: 1167 [2023-11-29 03:25:22,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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:25:22,195 INFO L413 NwaCegarLoop]: 908 mSDtfsCounter, 368 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:22,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1526 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:25:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2023-11-29 03:25:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1002. [2023-11-29 03:25:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 600 states have (on average 2.045) internal successors, (1227), 996 states have internal predecessors, (1227), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1235 transitions. [2023-11-29 03:25:22,210 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1235 transitions. Word has length 51 [2023-11-29 03:25:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:22,210 INFO L495 AbstractCegarLoop]: Abstraction has 1002 states and 1235 transitions. [2023-11-29 03:25:22,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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:25:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1235 transitions. [2023-11-29 03:25:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 03:25:22,211 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:22,211 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, 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:25:22,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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)] Ended with exit code 0 [2023-11-29 03:25:22,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:22,416 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:22,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash -747226817, now seen corresponding path program 1 times [2023-11-29 03:25:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:22,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335940750] [2023-11-29 03:25:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:22,417 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:22,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:22,418 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:22,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:22,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:25:22,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:22,712 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:22,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 5 [2023-11-29 03:25:23,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:25:23,156 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:25:23,168 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:25:23,168 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:25:23,183 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:25:23,183 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:23,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:23,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335940750] [2023-11-29 03:25:23,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335940750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:23,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:23,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:25:23,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068263351] [2023-11-29 03:25:23,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:23,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:25:23,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:23,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:25:23,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:25:23,186 INFO L87 Difference]: Start difference. First operand 1002 states and 1235 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:25,648 INFO L93 Difference]: Finished difference Result 1370 states and 1729 transitions. [2023-11-29 03:25:25,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:25:25,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2023-11-29 03:25:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:25,655 INFO L225 Difference]: With dead ends: 1370 [2023-11-29 03:25:25,655 INFO L226 Difference]: Without dead ends: 1370 [2023-11-29 03:25:25,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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:25:25,655 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 1104 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:25,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 349 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 03:25:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2023-11-29 03:25:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 941. [2023-11-29 03:25:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 577 states have (on average 1.9618717504332757) internal successors, (1132), 935 states have internal predecessors, (1132), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1140 transitions. [2023-11-29 03:25:25,673 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1140 transitions. Word has length 54 [2023-11-29 03:25:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:25,673 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1140 transitions. [2023-11-29 03:25:25,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1140 transitions. [2023-11-29 03:25:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 03:25:25,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:25,674 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, 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:25:25,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:25,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25,880 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:25,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:25,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1674587914, now seen corresponding path program 1 times [2023-11-29 03:25:25,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:25,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19146228] [2023-11-29 03:25:25,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:25,881 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:25,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:25,882 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:26,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:25:26,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:26,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:25:26,132 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:25:26,150 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:25:26,159 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:25:26,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:26,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:26,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19146228] [2023-11-29 03:25:26,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19146228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:26,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:26,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:25:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746636366] [2023-11-29 03:25:26,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:26,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:25:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:26,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:25:26,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:25:26,161 INFO L87 Difference]: Start difference. First operand 941 states and 1140 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:25:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:28,541 INFO L93 Difference]: Finished difference Result 940 states and 1139 transitions. [2023-11-29 03:25:28,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:25:28,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-11-29 03:25:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:28,545 INFO L225 Difference]: With dead ends: 940 [2023-11-29 03:25:28,545 INFO L226 Difference]: Without dead ends: 940 [2023-11-29 03:25:28,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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:25:28,545 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 3 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:28,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1817 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 03:25:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2023-11-29 03:25:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2023-11-29 03:25:28,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 577 states have (on average 1.9601386481802425) internal successors, (1131), 934 states have internal predecessors, (1131), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1139 transitions. [2023-11-29 03:25:28,564 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1139 transitions. Word has length 58 [2023-11-29 03:25:28,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:28,565 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1139 transitions. [2023-11-29 03:25:28,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:25:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1139 transitions. [2023-11-29 03:25:28,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 03:25:28,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:28,566 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, 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:25:28,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:28,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:28,766 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:28,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:28,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1674587913, now seen corresponding path program 1 times [2023-11-29 03:25:28,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:28,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530216613] [2023-11-29 03:25:28,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:28,767 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:28,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:28,768 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:28,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:29,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:25:29,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:29,018 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:29,038 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:25:29,047 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:25:29,082 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:25:29,098 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:25:29,098 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:29,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:29,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530216613] [2023-11-29 03:25:29,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530216613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:29,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:29,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:25:29,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180482224] [2023-11-29 03:25:29,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:29,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:25:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:29,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:25:29,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:25:29,100 INFO L87 Difference]: Start difference. First operand 940 states and 1139 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:25:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:32,249 INFO L93 Difference]: Finished difference Result 939 states and 1138 transitions. [2023-11-29 03:25:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:25:32,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-11-29 03:25:32,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:32,254 INFO L225 Difference]: With dead ends: 939 [2023-11-29 03:25:32,254 INFO L226 Difference]: Without dead ends: 939 [2023-11-29 03:25:32,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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:25:32,255 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 1 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:32,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1858 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 03:25:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2023-11-29 03:25:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2023-11-29 03:25:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 576 states have (on average 1.9618055555555556) internal successors, (1130), 933 states have internal predecessors, (1130), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:25:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1138 transitions. [2023-11-29 03:25:32,266 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1138 transitions. Word has length 58 [2023-11-29 03:25:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:32,266 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1138 transitions. [2023-11-29 03:25:32,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:25:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1138 transitions. [2023-11-29 03:25:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 03:25:32,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:32,267 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, 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, 1, 1] [2023-11-29 03:25:32,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:32,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:32,468 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:32,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:32,468 INFO L85 PathProgramCache]: Analyzing trace with hash 781679770, now seen corresponding path program 1 times [2023-11-29 03:25:32,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:32,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714470155] [2023-11-29 03:25:32,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:32,469 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:32,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:32,470 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:32,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:32,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:25:32,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:32,747 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:25:32,747 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:25:32,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:32,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714470155] [2023-11-29 03:25:32,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714470155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:25:32,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:25:32,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:25:32,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790052870] [2023-11-29 03:25:32,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:25:32,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:25:32,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:25:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:25:32,749 INFO L87 Difference]: Start difference. First operand 939 states and 1138 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:25:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:33,567 INFO L93 Difference]: Finished difference Result 941 states and 1141 transitions. [2023-11-29 03:25:33,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:25:33,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2023-11-29 03:25:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:33,574 INFO L225 Difference]: With dead ends: 941 [2023-11-29 03:25:33,574 INFO L226 Difference]: Without dead ends: 941 [2023-11-29 03:25:33,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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:25:33,575 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 1 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:33,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2109 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:25:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2023-11-29 03:25:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2023-11-29 03:25:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 577 states have (on average 1.9618717504332757) internal successors, (1132), 935 states have internal predecessors, (1132), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:25:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1141 transitions. [2023-11-29 03:25:33,590 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1141 transitions. Word has length 64 [2023-11-29 03:25:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:33,591 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1141 transitions. [2023-11-29 03:25:33,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:25:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1141 transitions. [2023-11-29 03:25:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 03:25:33,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:33,592 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, 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, 1, 1, 1] [2023-11-29 03:25:33,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:25:33,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:33,792 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:33,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:33,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1792487389, now seen corresponding path program 1 times [2023-11-29 03:25:33,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:33,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297948242] [2023-11-29 03:25:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:25:33,793 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:33,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:33,794 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:33,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:25:34,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:25:34,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:25:34,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:25:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:25:34,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297948242] [2023-11-29 03:25:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297948242] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:25:34,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:25:34,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 03:25:34,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779003858] [2023-11-29 03:25:34,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:25:34,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:25:34,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:34,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:25:34,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:25:34,156 INFO L87 Difference]: Start difference. First operand 941 states and 1141 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:25:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:35,661 INFO L93 Difference]: Finished difference Result 950 states and 1155 transitions. [2023-11-29 03:25:35,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:25:35,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-11-29 03:25:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:35,666 INFO L225 Difference]: With dead ends: 950 [2023-11-29 03:25:35,666 INFO L226 Difference]: Without dead ends: 950 [2023-11-29 03:25:35,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:25:35,667 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 6 mSDsluCounter, 3505 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4208 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:35,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4208 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 03:25:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2023-11-29 03:25:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 949. [2023-11-29 03:25:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 584 states have (on average 1.9606164383561644) internal successors, (1145), 942 states have internal predecessors, (1145), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:25:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1154 transitions. [2023-11-29 03:25:35,678 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1154 transitions. Word has length 65 [2023-11-29 03:25:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:35,678 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1154 transitions. [2023-11-29 03:25:35,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:25:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1154 transitions. [2023-11-29 03:25:35,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 03:25:35,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:35,679 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 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, 1, 1] [2023-11-29 03:25:35,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:35,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:35,880 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:35,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:35,880 INFO L85 PathProgramCache]: Analyzing trace with hash -233531686, now seen corresponding path program 2 times [2023-11-29 03:25:35,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:35,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937355254] [2023-11-29 03:25:35,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:25:35,881 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:35,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:35,881 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:35,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:36,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:25:36,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:25:36,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:25:36,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:25:36,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:25:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:25:36,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:36,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937355254] [2023-11-29 03:25:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937355254] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:25:36,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:25:36,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 03:25:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066667209] [2023-11-29 03:25:36,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:25:36,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:25:36,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:36,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:25:36,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:25:36,475 INFO L87 Difference]: Start difference. First operand 949 states and 1154 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:25:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:38,686 INFO L93 Difference]: Finished difference Result 964 states and 1176 transitions. [2023-11-29 03:25:38,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:25:38,687 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2023-11-29 03:25:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:38,691 INFO L225 Difference]: With dead ends: 964 [2023-11-29 03:25:38,691 INFO L226 Difference]: Without dead ends: 962 [2023-11-29 03:25:38,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 03:25:38,692 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 13 mSDsluCounter, 4210 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4913 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:38,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4913 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 03:25:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2023-11-29 03:25:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 958. [2023-11-29 03:25:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 593 states have (on average 1.951096121416526) internal successors, (1157), 951 states have internal predecessors, (1157), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:25:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1166 transitions. [2023-11-29 03:25:38,711 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1166 transitions. Word has length 68 [2023-11-29 03:25:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:38,711 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1166 transitions. [2023-11-29 03:25:38,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:25:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1166 transitions. [2023-11-29 03:25:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 03:25:38,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:38,712 INFO L195 NwaCegarLoop]: trace histogram [10, 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, 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, 1, 1] [2023-11-29 03:25:38,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:38,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:38,913 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:38,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:38,913 INFO L85 PathProgramCache]: Analyzing trace with hash -424549830, now seen corresponding path program 3 times [2023-11-29 03:25:38,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:38,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450452022] [2023-11-29 03:25:38,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:25:38,914 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:38,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:38,915 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:38,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:39,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 03:25:39,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:25:39,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:25:39,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:25:39,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:25:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:25:40,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:40,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450452022] [2023-11-29 03:25:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450452022] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:25:40,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:25:40,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 03:25:40,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212035614] [2023-11-29 03:25:40,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:25:40,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 03:25:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:40,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 03:25:40,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:25:40,224 INFO L87 Difference]: Start difference. First operand 958 states and 1166 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:25:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:25:45,087 INFO L93 Difference]: Finished difference Result 988 states and 1216 transitions. [2023-11-29 03:25:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 03:25:45,088 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2023-11-29 03:25:45,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:25:45,092 INFO L225 Difference]: With dead ends: 988 [2023-11-29 03:25:45,092 INFO L226 Difference]: Without dead ends: 985 [2023-11-29 03:25:45,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 03:25:45,093 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 25 mSDsluCounter, 7709 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8411 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:25:45,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8411 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 03:25:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2023-11-29 03:25:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 976. [2023-11-29 03:25:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 611 states have (on average 1.9312602291325696) internal successors, (1180), 969 states have internal predecessors, (1180), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:25:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1189 transitions. [2023-11-29 03:25:45,109 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1189 transitions. Word has length 74 [2023-11-29 03:25:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:25:45,109 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1189 transitions. [2023-11-29 03:25:45,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:25:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1189 transitions. [2023-11-29 03:25:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 03:25:45,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:25:45,110 INFO L195 NwaCegarLoop]: trace histogram [22, 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, 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, 1, 1] [2023-11-29 03:25:45,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:45,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:45,311 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:25:45,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:25:45,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1080582394, now seen corresponding path program 4 times [2023-11-29 03:25:45,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:25:45,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029297751] [2023-11-29 03:25:45,312 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 03:25:45,312 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:45,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:25:45,313 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:45,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:25:45,660 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 03:25:45,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:25:45,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 03:25:45,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:25:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:25:46,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:25:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:25:47,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:25:47,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029297751] [2023-11-29 03:25:47,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029297751] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:25:47,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:25:47,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 03:25:47,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866598044] [2023-11-29 03:25:47,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:25:47,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 03:25:47,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:25:47,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 03:25:47,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 03:25:47,499 INFO L87 Difference]: Start difference. First operand 976 states and 1189 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:26:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:26:00,747 INFO L93 Difference]: Finished difference Result 1033 states and 1278 transitions. [2023-11-29 03:26:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 03:26:00,748 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2023-11-29 03:26:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:26:00,753 INFO L225 Difference]: With dead ends: 1033 [2023-11-29 03:26:00,753 INFO L226 Difference]: Without dead ends: 1031 [2023-11-29 03:26:00,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 03:26:00,758 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 47 mSDsluCounter, 18249 mSDsCounter, 0 mSdLazyCounter, 4909 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 18952 SdHoareTripleChecker+Invalid, 4967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 4909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:26:00,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 18952 Invalid, 4967 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 4909 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2023-11-29 03:26:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2023-11-29 03:26:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1010. [2023-11-29 03:26:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 645 states have (on average 1.9007751937984496) internal successors, (1226), 1003 states have internal predecessors, (1226), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:26:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1235 transitions. [2023-11-29 03:26:00,786 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1235 transitions. Word has length 86 [2023-11-29 03:26:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:26:00,786 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 1235 transitions. [2023-11-29 03:26:00,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:26:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1235 transitions. [2023-11-29 03:26:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 03:26:00,787 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:26:00,787 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1] [2023-11-29 03:26:00,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:26:00,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:00,988 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:26:00,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:26:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 357547354, now seen corresponding path program 5 times [2023-11-29 03:26:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:26:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125994013] [2023-11-29 03:26:00,989 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:26:00,989 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:00,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:26:00,990 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:00,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:26:02,303 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 03:26:02,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:26:02,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 03:26:02,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:26:02,342 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:02,440 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:26:02,440 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:26:02,473 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:26:02,551 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 12 [2023-11-29 03:26:03,432 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:26:03,433 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:26:03,489 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:26:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:26:03,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:26:03,906 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 03:26:03,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:26:03,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125994013] [2023-11-29 03:26:03,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125994013] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:26:03,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1255446853] [2023-11-29 03:26:03,908 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:26:03,908 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:26:03,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:26:03,909 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:26:03,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 03:27:07,218 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 03:27:07,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:27:07,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 03:27:07,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:27:07,452 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:07,701 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:27:07,701 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:27:07,753 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:27:07,861 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:27:08,625 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:27:08,626 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 36 treesize of output 35 [2023-11-29 03:27:08,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 27 treesize of output 15 [2023-11-29 03:27:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:27:08,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:27:09,053 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2464) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 03:27:09,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1255446853] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:27:09,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:27:09,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 03:27:09,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765125162] [2023-11-29 03:27:09,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:27:09,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 03:27:09,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:27:09,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 03:27:09,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=163, Unknown=2, NotChecked=54, Total=272 [2023-11-29 03:27:09,057 INFO L87 Difference]: Start difference. First operand 1010 states and 1235 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:27:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:27:15,225 INFO L93 Difference]: Finished difference Result 1417 states and 1766 transitions. [2023-11-29 03:27:15,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:27:15,226 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 03:27:15,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:27:15,233 INFO L225 Difference]: With dead ends: 1417 [2023-11-29 03:27:15,233 INFO L226 Difference]: Without dead ends: 1415 [2023-11-29 03:27:15,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=184, Unknown=2, NotChecked=58, Total=306 [2023-11-29 03:27:15,234 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 704 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 3395 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:27:15,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2977 Invalid, 3401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3395 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-11-29 03:27:15,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2023-11-29 03:27:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1009. [2023-11-29 03:27:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 645 states have (on average 1.8930232558139535) internal successors, (1221), 1002 states have internal predecessors, (1221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:27:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1230 transitions. [2023-11-29 03:27:15,247 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1230 transitions. Word has length 108 [2023-11-29 03:27:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:27:15,248 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1230 transitions. [2023-11-29 03:27:15,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:27:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1230 transitions. [2023-11-29 03:27:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 03:27:15,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:27:15,248 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1] [2023-11-29 03:27:15,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:27:15,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 03:27:15,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:27:15,649 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:27:15,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:27:15,649 INFO L85 PathProgramCache]: Analyzing trace with hash 357547355, now seen corresponding path program 1 times [2023-11-29 03:27:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:27:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339951615] [2023-11-29 03:27:15,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:27:15,650 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:15,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:27:15,651 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:15,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:27:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:27:16,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 03:27:16,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:27:16,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:27:16,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:27:16,529 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:27:16,530 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:16,560 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:27:16,568 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:27:16,655 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 18 treesize of output 10 [2023-11-29 03:27:16,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:27:17,257 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:27:17,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:27:17,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:27:17,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:27:17,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:27:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:27:17,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:27:18,693 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3019 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 03:27:18,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:27:18,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339951615] [2023-11-29 03:27:18,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339951615] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:27:18,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1702444444] [2023-11-29 03:27:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:27:18,700 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:27:18,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:27:18,701 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:27:18,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 03:28:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:58,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 03:28:58,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:58,373 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:28:58,578 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:28:58,592 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:28:58,592 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:28:58,619 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:28:58,625 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:28:58,675 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 18 treesize of output 10 [2023-11-29 03:28:58,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:28:59,269 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:28:59,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:28:59,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:28:59,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 25 treesize of output 13 [2023-11-29 03:28:59,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:28:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:28:59,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:00,521 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3574) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3574) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2023-11-29 03:29:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1702444444] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:29:00,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:29:00,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 03:29:00,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431886075] [2023-11-29 03:29:00,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:29:00,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:29:00,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:29:00,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:29:00,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 03:29:00,528 INFO L87 Difference]: Start difference. First operand 1009 states and 1230 transitions. Second operand has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:29:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:29:07,340 INFO L93 Difference]: Finished difference Result 1414 states and 1761 transitions. [2023-11-29 03:29:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:29:07,341 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2023-11-29 03:29:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:29:07,346 INFO L225 Difference]: With dead ends: 1414 [2023-11-29 03:29:07,346 INFO L226 Difference]: Without dead ends: 1414 [2023-11-29 03:29:07,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 03:29:07,347 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 660 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:29:07,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1753 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-11-29 03:29:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2023-11-29 03:29:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1008. [2023-11-29 03:29:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 645 states have (on average 1.8914728682170543) internal successors, (1220), 1001 states have internal predecessors, (1220), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:29:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1229 transitions. [2023-11-29 03:29:07,364 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1229 transitions. Word has length 108 [2023-11-29 03:29:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:29:07,365 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1229 transitions. [2023-11-29 03:29:07,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:29:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1229 transitions. [2023-11-29 03:29:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 03:29:07,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:29:07,366 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1] [2023-11-29 03:29:07,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:29:07,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 03:29:07,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:29:07,767 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:29:07,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:29:07,767 INFO L85 PathProgramCache]: Analyzing trace with hash 6950647, now seen corresponding path program 1 times [2023-11-29 03:29:07,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:29:07,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248138798] [2023-11-29 03:29:07,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:29:07,768 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:29:07,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:29:07,769 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:29:07,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:29:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:29:08,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 03:29:08,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:08,503 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:29:08,600 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:29:08,600 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:29:08,631 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:29:08,704 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 12 [2023-11-29 03:29:09,409 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:29:09,409 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:29:09,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:29:09,511 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:29:09,524 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:29:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:29:09,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:13,659 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3998 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:29:14,017 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4044 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4044))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3998)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:29:14,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:29:14,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248138798] [2023-11-29 03:29:14,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248138798] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:29:14,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1792876660] [2023-11-29 03:29:14,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:29:14,019 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:29:14,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:29:14,020 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:29:14,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 03:29:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:29:16,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 03:29:16,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:16,144 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:29:16,475 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:29:16,475 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:29:16,530 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:29:16,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 20 treesize of output 12 [2023-11-29 03:29:17,479 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:29:17,479 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 36 treesize of output 35 [2023-11-29 03:29:17,617 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:29:17,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:29:17,632 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:29:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:29:17,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:22,074 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4514))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3998)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:29:22,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1792876660] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:29:22,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:29:22,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 03:29:22,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842932537] [2023-11-29 03:29:22,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:29:22,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 03:29:22,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:29:22,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 03:29:22,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=242, Unknown=4, NotChecked=102, Total=420 [2023-11-29 03:29:22,078 INFO L87 Difference]: Start difference. First operand 1008 states and 1229 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:29:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:29:30,720 INFO L93 Difference]: Finished difference Result 1413 states and 1760 transitions. [2023-11-29 03:29:30,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:29:30,722 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 03:29:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:29:30,728 INFO L225 Difference]: With dead ends: 1413 [2023-11-29 03:29:30,728 INFO L226 Difference]: Without dead ends: 1413 [2023-11-29 03:29:30,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=81, Invalid=269, Unknown=4, NotChecked=108, Total=462 [2023-11-29 03:29:30,729 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 699 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 3386 SdHoareTripleChecker+Invalid, 3934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:29:30,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 3386 Invalid, 3934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-11-29 03:29:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2023-11-29 03:29:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1007. [2023-11-29 03:29:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 645 states have (on average 1.889922480620155) internal successors, (1219), 1000 states have internal predecessors, (1219), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:29:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1228 transitions. [2023-11-29 03:29:30,746 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1228 transitions. Word has length 110 [2023-11-29 03:29:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:29:30,747 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1228 transitions. [2023-11-29 03:29:30,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:29:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1228 transitions. [2023-11-29 03:29:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 03:29:30,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:29:30,748 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1] [2023-11-29 03:29:30,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 03:29:30,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:29:31,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:29:31,149 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:29:31,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:29:31,149 INFO L85 PathProgramCache]: Analyzing trace with hash 6950648, now seen corresponding path program 1 times [2023-11-29 03:29:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:29:31,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290912290] [2023-11-29 03:29:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:29:31,150 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:29:31,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:29:31,151 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:29:31,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:29:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:29:31,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 03:29:31,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:31,916 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:29:32,203 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:29:32,217 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:29:32,217 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:29:32,244 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:29:32,255 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:29:32,364 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 18 treesize of output 10 [2023-11-29 03:29:32,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:29:32,989 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:29:32,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:29:32,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:29:33,111 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:29:33,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:29:33,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:29:33,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:29:33,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:29:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:29:33,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:33,305 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 03:29:33,340 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_4984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:29:34,613 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5077))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5076) .cse0 v_ArrVal_4985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5076) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5077) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 03:29:34,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:29:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290912290] [2023-11-29 03:29:34,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290912290] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:29:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1254276680] [2023-11-29 03:29:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:29:34,622 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:29:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:29:34,623 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:29:34,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 03:31:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:31:29,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 03:31:29,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:31:29,092 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:31:29,384 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:31:29,384 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:31:29,396 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:31:29,413 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:31:29,417 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:31:29,488 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 18 treesize of output 10 [2023-11-29 03:31:29,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:31:30,266 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:31:30,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:31:30,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:31:30,355 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:31:30,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:31:30,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:31:30,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 25 treesize of output 13 [2023-11-29 03:31:30,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:31:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:31:30,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:31:30,440 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:31:30,476 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_5548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 03:31:31,645 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5640) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5639))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5640) .cse2 v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:31:31,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1254276680] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:31:31,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:31:31,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 03:31:31,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22981016] [2023-11-29 03:31:31,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:31:31,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:31:31,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:31:31,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:31:31,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2023-11-29 03:31:31,666 INFO L87 Difference]: Start difference. First operand 1007 states and 1228 transitions. Second operand has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:31:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:31:41,480 INFO L93 Difference]: Finished difference Result 1412 states and 1759 transitions. [2023-11-29 03:31:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:31:41,481 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2023-11-29 03:31:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:31:41,486 INFO L225 Difference]: With dead ends: 1412 [2023-11-29 03:31:41,486 INFO L226 Difference]: Without dead ends: 1412 [2023-11-29 03:31:41,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2023-11-29 03:31:41,487 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 658 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 3542 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 3549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:31:41,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1756 Invalid, 3549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3542 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2023-11-29 03:31:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2023-11-29 03:31:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1006. [2023-11-29 03:31:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 645 states have (on average 1.8883720930232557) internal successors, (1218), 999 states have internal predecessors, (1218), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:31:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1227 transitions. [2023-11-29 03:31:41,508 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1227 transitions. Word has length 110 [2023-11-29 03:31:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:31:41,508 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 1227 transitions. [2023-11-29 03:31:41,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:31:41,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1227 transitions. [2023-11-29 03:31:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 03:31:41,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:31:41,510 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 03:31:41,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-11-29 03:31:41,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:31:41,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:31:41,910 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:31:41,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:31:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1909040273, now seen corresponding path program 1 times [2023-11-29 03:31:41,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:31:41,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143136057] [2023-11-29 03:31:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:31:41,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:31:41,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:31:41,912 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:31:41,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:31:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:31:42,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 03:31:42,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:31:42,795 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:31:42,934 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:31:42,934 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:31:42,975 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:31:43,073 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 12 [2023-11-29 03:31:44,115 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:31:44,115 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:31:44,255 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:31:44,255 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:31:44,364 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:31:44,364 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:31:44,381 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:31:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:31:44,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:31:44,518 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6080) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 03:31:44,532 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:31:44,549 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:31:44,565 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:31:45,027 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6126))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6079)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:31:45,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:31:45,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143136057] [2023-11-29 03:31:45,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143136057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:31:45,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [557810097] [2023-11-29 03:31:45,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:31:45,032 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:31:45,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:31:45,033 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:31:45,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 03:32:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:18,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 03:32:18,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:32:18,457 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:32:18,837 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:32:18,837 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:32:18,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:32:19,078 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:32:20,114 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:32:20,115 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 36 treesize of output 35 [2023-11-29 03:32:20,344 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:32:20,344 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 36 treesize of output 35 [2023-11-29 03:32:20,466 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:32:20,466 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 36 treesize of output 35 [2023-11-29 03:32:20,481 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:32:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:32:20,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:32:24,602 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6566) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 03:32:24,619 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6565))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6566)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:32:24,634 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6565))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6566)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:32:25,073 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6612))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6565)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6566)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:32:25,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [557810097] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:32:25,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:32:25,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 03:32:25,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894774484] [2023-11-29 03:32:25,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:32:25,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:32:25,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:32:25,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:32:25,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=307, Unknown=12, NotChecked=396, Total=812 [2023-11-29 03:32:25,080 INFO L87 Difference]: Start difference. First operand 1006 states and 1227 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:32:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:32:35,183 INFO L93 Difference]: Finished difference Result 1411 states and 1758 transitions. [2023-11-29 03:32:35,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:32:35,185 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-11-29 03:32:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:32:35,191 INFO L225 Difference]: With dead ends: 1411 [2023-11-29 03:32:35,192 INFO L226 Difference]: Without dead ends: 1411 [2023-11-29 03:32:35,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=106, Invalid=338, Unknown=12, NotChecked=414, Total=870 [2023-11-29 03:32:35,193 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 697 mSDsluCounter, 2629 mSDsCounter, 0 mSdLazyCounter, 3509 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 3018 SdHoareTripleChecker+Invalid, 3514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:32:35,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 3018 Invalid, 3514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3509 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2023-11-29 03:32:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2023-11-29 03:32:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1005. [2023-11-29 03:32:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 645 states have (on average 1.8868217054263565) internal successors, (1217), 998 states have internal predecessors, (1217), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:32:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1226 transitions. [2023-11-29 03:32:35,210 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1226 transitions. Word has length 112 [2023-11-29 03:32:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:32:35,210 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1226 transitions. [2023-11-29 03:32:35,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:32:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1226 transitions. [2023-11-29 03:32:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 03:32:35,211 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:32:35,211 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 03:32:35,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 03:32:35,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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)] Ended with exit code 0 [2023-11-29 03:32:35,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:32:35,612 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:32:35,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:32:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1909040272, now seen corresponding path program 1 times [2023-11-29 03:32:35,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:32:35,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952349557] [2023-11-29 03:32:35,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:35,613 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:32:35,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:32:35,614 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:32:35,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:32:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:36,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 03:32:36,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:32:36,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:32:37,150 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:32:37,177 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:32:37,177 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:32:37,216 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:32:37,226 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:32:37,368 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 18 treesize of output 10 [2023-11-29 03:32:37,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:32:38,219 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:32:38,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:32:38,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:32:38,378 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:32:38,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:32:38,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:32:38,499 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:32:38,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:32:38,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:32:38,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:32:38,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:32:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:32:38,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:32:38,759 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 03:32:38,795 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:32:38,898 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7098))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7097) .cse0 v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7097) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 03:32:39,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_7098))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_7097) .cse1 v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_7097) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_7098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 03:32:40,730 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7191))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7192) .cse1 v_ArrVal_7097) (select (select (store .cse2 .cse1 v_ArrVal_7098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7100))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7191))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7098))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7192) .cse4 v_ArrVal_7097) .cse5 v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 03:32:40,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:32:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952349557] [2023-11-29 03:32:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952349557] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:32:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [58615069] [2023-11-29 03:32:40,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:32:40,750 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:32:40,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:32:40,751 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:32:40,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 03:33:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:13,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 03:33:13,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:33:13,716 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:33:14,062 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:33:14,063 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:33:14,075 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:33:14,094 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:33:14,103 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:33:14,182 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 18 treesize of output 10 [2023-11-29 03:33:14,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:33:14,967 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:33:14,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:33:14,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:33:15,090 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:33:15,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:33:15,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:33:15,162 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:33:15,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:33:15,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:33:15,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:33:15,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:33:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:33:15,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:33:15,278 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:33:15,323 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:33:15,380 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7678))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7677) .cse0 v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7677) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 03:33:15,439 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7677) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7678))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7677) .cse3 v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:33:17,137 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7771))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7678))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7772) .cse0 v_ArrVal_7677) .cse1 v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7771))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7772) .cse6 v_ArrVal_7677) (select (select (store .cse7 .cse6 v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7680))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 03:33:17,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [58615069] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:33:17,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:33:17,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-11-29 03:33:17,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613054579] [2023-11-29 03:33:17,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:33:17,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:33:17,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:33:17,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:33:17,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=134, Unknown=10, NotChecked=310, Total=506 [2023-11-29 03:33:17,157 INFO L87 Difference]: Start difference. First operand 1005 states and 1226 transitions. Second operand has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:33:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:33:30,777 INFO L93 Difference]: Finished difference Result 1410 states and 1757 transitions. [2023-11-29 03:33:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:33:30,779 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2023-11-29 03:33:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:33:30,784 INFO L225 Difference]: With dead ends: 1410 [2023-11-29 03:33:30,785 INFO L226 Difference]: Without dead ends: 1410 [2023-11-29 03:33:30,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=282, Unknown=10, NotChecked=430, Total=812 [2023-11-29 03:33:30,786 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 653 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 4680 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 4686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:33:30,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 2198 Invalid, 4686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4680 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2023-11-29 03:33:30,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2023-11-29 03:33:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1004. [2023-11-29 03:33:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 645 states have (on average 1.8852713178294573) internal successors, (1216), 997 states have internal predecessors, (1216), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:33:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1225 transitions. [2023-11-29 03:33:30,803 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1225 transitions. Word has length 112 [2023-11-29 03:33:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:33:30,804 INFO L495 AbstractCegarLoop]: Abstraction has 1004 states and 1225 transitions. [2023-11-29 03:33:30,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:33:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1225 transitions. [2023-11-29 03:33:30,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 03:33:30,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:33:30,805 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:33:30,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 03:33:31,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:33:31,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:33:31,206 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:33:31,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:33:31,206 INFO L85 PathProgramCache]: Analyzing trace with hash -635349951, now seen corresponding path program 1 times [2023-11-29 03:33:31,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:33:31,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176443155] [2023-11-29 03:33:31,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:31,207 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:33:31,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:33:31,215 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:33:31,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:33:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:32,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 03:33:32,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:33:32,511 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:33:32,717 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:33:32,718 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:33:32,765 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:33:32,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 24 treesize of output 12 [2023-11-29 03:33:33,875 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:33,876 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:33:34,006 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:34,007 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:33:34,110 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:34,111 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:33:34,215 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:34,216 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:33:34,230 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:33:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:33:34,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:33:34,365 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8228) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:33:38,472 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8227))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8228)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:33:38,489 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8228)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:33:38,507 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8226))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8228)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:33:38,528 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8226))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8228)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:33:38,987 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8274))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8226)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8228)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:33:38,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:33:38,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176443155] [2023-11-29 03:33:38,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176443155] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:33:38,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [571601212] [2023-11-29 03:33:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:38,991 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:33:38,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:33:38,992 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:33:38,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 03:34:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:20,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 03:34:20,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:20,044 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:34:20,460 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:34:20,461 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:34:20,532 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:34:20,741 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:34:21,714 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:21,715 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 36 treesize of output 35 [2023-11-29 03:34:21,935 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:21,935 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 36 treesize of output 35 [2023-11-29 03:34:22,080 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:22,080 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 36 treesize of output 35 [2023-11-29 03:34:22,235 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:22,235 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 36 treesize of output 35 [2023-11-29 03:34:22,251 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:34:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:34:22,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:34:22,288 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:34:22,302 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:34:22,321 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8730))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8731)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:34:22,339 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8730))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8731)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:34:22,360 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8729))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8730)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8731)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:34:22,383 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8729))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8730)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8731)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:34:22,839 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8777))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8729)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8730)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8731)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:34:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [571601212] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:34:22,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:34:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 03:34:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458039708] [2023-11-29 03:34:22,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:34:22,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 03:34:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:34:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 03:34:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=373, Unknown=15, NotChecked=676, Total=1190 [2023-11-29 03:34:22,847 INFO L87 Difference]: Start difference. First operand 1004 states and 1225 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:34:32,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:34:32,337 INFO L93 Difference]: Finished difference Result 1409 states and 1756 transitions. [2023-11-29 03:34:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:34:32,340 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2023-11-29 03:34:32,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:34:32,343 INFO L225 Difference]: With dead ends: 1409 [2023-11-29 03:34:32,343 INFO L226 Difference]: Without dead ends: 1409 [2023-11-29 03:34:32,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=136, Invalid=407, Unknown=15, NotChecked=702, Total=1260 [2023-11-29 03:34:32,344 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 691 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 2650 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:34:32,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 2650 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2023-11-29 03:34:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2023-11-29 03:34:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1003. [2023-11-29 03:34:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 645 states have (on average 1.8837209302325582) internal successors, (1215), 996 states have internal predecessors, (1215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:34:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1224 transitions. [2023-11-29 03:34:32,359 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1224 transitions. Word has length 114 [2023-11-29 03:34:32,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:34:32,359 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1224 transitions. [2023-11-29 03:34:32,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:34:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1224 transitions. [2023-11-29 03:34:32,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 03:34:32,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:34:32,360 INFO L195 NwaCegarLoop]: trace histogram [44, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:34:32,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 03:34:32,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:34:32,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:34:32,761 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 03:34:32,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:34:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash -635349950, now seen corresponding path program 1 times [2023-11-29 03:34:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:34:32,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913316245] [2023-11-29 03:34:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:32,763 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:34:32,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:34:32,764 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:34:32,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/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:34:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:34:34,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 03:34:34,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:34:34,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:34:34,523 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:34:34,523 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:34:34,544 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:34:34,577 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:34:34,595 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:34:34,722 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 18 treesize of output 10 [2023-11-29 03:34:34,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:34:35,559 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:35,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:34:35,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:34:35,714 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:35,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:34:35,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:34:35,845 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:35,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:34:35,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:34:35,981 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:34:35,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:34:35,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:34:36,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:34:36,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:34:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:34:36,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:34:36,271 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:34:36,315 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 03:34:36,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9280))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9279) .cse0 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9279) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 03:34:36,434 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_9280))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_9279) .cse1 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_9279) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 03:34:36,523 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9277))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9278) .cse1 v_ArrVal_9279) (select (select (store .cse2 .cse1 v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9282))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9277))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9280))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9278) .cse4 v_ArrVal_9279) .cse5 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 03:34:36,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_9277))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9278) .cse2 v_ArrVal_9279) (select (select (store .cse3 .cse2 v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9282))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_9277))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9280))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9278) .cse5 v_ArrVal_9279) .cse6 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 03:34:42,639 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9373 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9373))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9277))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9374) .cse1 v_ArrVal_9278) .cse2 v_ArrVal_9279) (select (select (store .cse3 .cse2 v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9282))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9373 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9373))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9277))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9280))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9374) .cse6 v_ArrVal_9278) .cse7 v_ArrVal_9279) .cse8 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 03:34:42,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:34:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913316245] [2023-11-29 03:34:42,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913316245] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:34:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [106279864] [2023-11-29 03:34:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:34:42,676 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:34:42,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:34:42,678 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:34:42,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f49b80f-89b3-4443-8914-935372d39b40/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process