./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/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_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/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_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/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 cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:50:32,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:50:32,847 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 00:50:32,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:50:32,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:50:32,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:50:32,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:50:32,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:50:32,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:50:32,878 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:50:32,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:50:32,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:50:32,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:50:32,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:50:32,882 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:50:32,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:50:32,883 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:50:32,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:50:32,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:50:32,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:50:32,885 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:50:32,886 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:50:32,886 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:50:32,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:50:32,887 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:50:32,888 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:50:32,888 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:50:32,889 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:50:32,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:50:32,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:50:32,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:50:32,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:50:32,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:50:32,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:50:32,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:50:32,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:50:32,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:50:32,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:50:32,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:50:32,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:50:32,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:50:32,893 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_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/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_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/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 -> cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 [2023-11-29 00:50:33,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:50:33,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:50:33,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:50:33,163 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:50:33,163 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:50:33,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2023-11-29 00:50:35,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:50:36,344 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:50:36,344 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2023-11-29 00:50:36,369 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/data/47c73ee87/970a710ab14746e79319711c3758e354/FLAGbd2fb2961 [2023-11-29 00:50:36,385 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/data/47c73ee87/970a710ab14746e79319711c3758e354 [2023-11-29 00:50:36,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:50:36,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:50:36,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:50:36,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:50:36,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:50:36,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:50:36" (1/1) ... [2023-11-29 00:50:36,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dba14ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:36, skipping insertion in model container [2023-11-29 00:50:36,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:50:36" (1/1) ... [2023-11-29 00:50:36,499 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:50:37,228 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:50:37,242 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 00:50:37,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7fdf0150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:37, skipping insertion in model container [2023-11-29 00:50:37,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:50:37,244 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 00:50:37,246 INFO L158 Benchmark]: Toolchain (without parser) took 855.02ms. Allocated memory is still 153.1MB. Free memory was 112.1MB in the beginning and 78.0MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-29 00:50:37,246 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:50:37,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 852.38ms. Allocated memory is still 153.1MB. Free memory was 111.6MB in the beginning and 78.0MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-29 00:50:37,249 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.22ms. Allocated memory is still 153.1MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 852.38ms. Allocated memory is still 153.1MB. Free memory was 111.6MB in the beginning and 78.0MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/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_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/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_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/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 cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:50:39,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:50:39,183 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 00:50:39,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:50:39,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:50:39,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:50:39,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:50:39,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:50:39,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:50:39,220 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:50:39,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:50:39,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:50:39,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:50:39,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:50:39,223 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:50:39,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:50:39,224 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:50:39,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:50:39,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:50:39,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:50:39,226 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:50:39,227 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:50:39,227 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:50:39,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:50:39,228 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:50:39,229 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:50:39,229 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:50:39,230 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:50:39,230 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:50:39,230 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:50:39,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:50:39,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:50:39,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:50:39,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:50:39,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:50:39,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:50:39,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:50:39,233 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:50:39,233 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:50:39,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:50:39,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:50:39,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:50:39,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:50:39,234 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:50:39,234 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_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/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_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/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 -> cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 [2023-11-29 00:50:39,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:50:39,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:50:39,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:50:39,576 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:50:39,576 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:50:39,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2023-11-29 00:50:42,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:50:43,321 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:50:43,321 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2023-11-29 00:50:43,347 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/data/2daca9f83/494ef9408eab4a4d9d4f40897bd846b5/FLAGab6083f88 [2023-11-29 00:50:43,363 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/data/2daca9f83/494ef9408eab4a4d9d4f40897bd846b5 [2023-11-29 00:50:43,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:50:43,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:50:43,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:50:43,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:50:43,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:50:43,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:50:43" (1/1) ... [2023-11-29 00:50:43,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@becac9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:43, skipping insertion in model container [2023-11-29 00:50:43,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:50:43" (1/1) ... [2023-11-29 00:50:43,473 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:50:44,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:50:44,093 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 00:50:44,116 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:50:44,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:50:44,257 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:50:44,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:50:44,384 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:50:44,390 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:50:44,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44 WrapperNode [2023-11-29 00:50:44,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:50:44,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:50:44,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:50:44,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:50:44,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,544 INFO L138 Inliner]: procedures = 180, calls = 783, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3040 [2023-11-29 00:50:44,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:50:44,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:50:44,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:50:44,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:50:44,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,658 INFO L175 MemorySlicer]: Split 261 memory accesses to 4 slices as follows [2, 220, 5, 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, 50, 1, 4]. [2023-11-29 00:50:44,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:50:44,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:50:44,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:50:44,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:50:44,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (1/1) ... [2023-11-29 00:50:44,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:50:44,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:50:44,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:50:44,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:50:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 00:50:44,889 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 00:50:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 00:50:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 00:50:44,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 00:50:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 00:50:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 00:50:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 00:50:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 00:50:44,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 00:50:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 00:50:44,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 00:50:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 00:50:44,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 00:50:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 00:50:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 00:50:44,892 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 00:50:44,892 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 00:50:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 00:50:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 00:50:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:50:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:50:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:50:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:50:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 00:50:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 00:50:44,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:50:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 00:50:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:50:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:50:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 00:50:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 00:50:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:50:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 00:50:44,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 00:50:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 00:50:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 00:50:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:50:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:50:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:50:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 00:50:44,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:50:44,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:50:45,123 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:50:45,125 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:50:45,145 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:50:45,193 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:50:45,214 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:50:45,235 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:50:52,035 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:50:52,252 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:50:52,253 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-11-29 00:50:52,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:50:52 BoogieIcfgContainer [2023-11-29 00:50:52,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:50:52,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:50:52,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:50:52,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:50:52,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:50:43" (1/3) ... [2023-11-29 00:50:52,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed391f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:50:52, skipping insertion in model container [2023-11-29 00:50:52,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:50:44" (2/3) ... [2023-11-29 00:50:52,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed391f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:50:52, skipping insertion in model container [2023-11-29 00:50:52,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:50:52" (3/3) ... [2023-11-29 00:50:52,265 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test9-2.i [2023-11-29 00:50:52,287 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:50:52,287 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 535 error locations. [2023-11-29 00:50:52,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:50:52,389 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;@2870152e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:50:52,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 535 error locations. [2023-11-29 00:50:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 1974 states, 933 states have (on average 2.2411575562700965) internal successors, (2091), 1967 states have internal predecessors, (2091), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2023-11-29 00:50:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:50:52,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:52,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:50:52,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:50:52,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:52,415 INFO L85 PathProgramCache]: Analyzing trace with hash 178981, now seen corresponding path program 1 times [2023-11-29 00:50:52,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:50:52,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970060671] [2023-11-29 00:50:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:52,428 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 00:50:52,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:50:52,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:50:52,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:50:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:50:52,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:50:52,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:52,676 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 00:50:52,689 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 00:50:52,689 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:50:52,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:50:52,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970060671] [2023-11-29 00:50:52,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970060671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:50:52,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:50:52,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:50:52,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329715559] [2023-11-29 00:50:52,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:50:52,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:50:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:50:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:50:52,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:50:52,731 INFO L87 Difference]: Start difference. First operand has 1974 states, 933 states have (on average 2.2411575562700965) internal successors, (2091), 1967 states have internal predecessors, (2091), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) 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 00:50:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:56,110 INFO L93 Difference]: Finished difference Result 2126 states and 3192 transitions. [2023-11-29 00:50:56,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:50:56,113 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 00:50:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:56,154 INFO L225 Difference]: With dead ends: 2126 [2023-11-29 00:50:56,154 INFO L226 Difference]: Without dead ends: 2125 [2023-11-29 00:50:56,155 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 00:50:56,159 INFO L413 NwaCegarLoop]: 2526 mSDtfsCounter, 1896 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:56,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 2654 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 00:50:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2023-11-29 00:50:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1960. [2023-11-29 00:50:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 936 states have (on average 2.1474358974358974) internal successors, (2010), 1953 states have internal predecessors, (2010), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-11-29 00:50:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 3018 transitions. [2023-11-29 00:50:56,508 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 3018 transitions. Word has length 2 [2023-11-29 00:50:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:56,508 INFO L495 AbstractCegarLoop]: Abstraction has 1960 states and 3018 transitions. [2023-11-29 00:50:56,509 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 00:50:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 3018 transitions. [2023-11-29 00:50:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:50:56,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:56,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:50:56,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:50:56,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:50:56,712 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:50:56,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash 178982, now seen corresponding path program 1 times [2023-11-29 00:50:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:50:56,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612240110] [2023-11-29 00:50:56,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:56,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:56,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:50:56,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:50:56,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:50:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:50:56,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:50:56,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:56,865 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 00:50:56,878 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 00:50:56,879 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:50:56,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:50:56,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612240110] [2023-11-29 00:50:56,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612240110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:50:56,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:50:56,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:50:56,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255892278] [2023-11-29 00:50:56,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:50:56,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:50:56,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:50:56,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:50:56,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:50:56,883 INFO L87 Difference]: Start difference. First operand 1960 states and 3018 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 00:51:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:02,207 INFO L93 Difference]: Finished difference Result 3331 states and 5422 transitions. [2023-11-29 00:51:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:51:02,208 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 00:51:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:02,238 INFO L225 Difference]: With dead ends: 3331 [2023-11-29 00:51:02,238 INFO L226 Difference]: Without dead ends: 3331 [2023-11-29 00:51:02,239 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 00:51:02,240 INFO L413 NwaCegarLoop]: 2840 mSDtfsCounter, 1403 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1903 SdHoareTripleChecker+Valid, 4824 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:02,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1903 Valid, 4824 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-11-29 00:51:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2023-11-29 00:51:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3062. [2023-11-29 00:51:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 1539 states have (on average 2.0909681611436) internal successors, (3218), 3055 states have internal predecessors, (3218), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:51:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 5226 transitions. [2023-11-29 00:51:02,644 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 5226 transitions. Word has length 2 [2023-11-29 00:51:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:02,644 INFO L495 AbstractCegarLoop]: Abstraction has 3062 states and 5226 transitions. [2023-11-29 00:51:02,645 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 00:51:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 5226 transitions. [2023-11-29 00:51:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 00:51:02,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:02,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:51:02,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:02,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:02,846 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:02,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2084700783, now seen corresponding path program 1 times [2023-11-29 00:51:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:02,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864312498] [2023-11-29 00:51:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:02,848 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 00:51:02,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:02,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:02,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:02,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:51:03,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:03,015 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 00:51:03,022 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 00:51:03,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:51:03,103 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 00:51:03,129 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:51:03,129 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 00:51:03,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 00:51:03,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:03,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:03,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864312498] [2023-11-29 00:51:03,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864312498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:03,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:03,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:51:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028366112] [2023-11-29 00:51:03,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:03,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:51:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:03,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:51:03,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:51:03,164 INFO L87 Difference]: Start difference. First operand 3062 states and 5226 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 00:51:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:09,655 INFO L93 Difference]: Finished difference Result 3216 states and 5388 transitions. [2023-11-29 00:51:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:51:09,655 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 00:51:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:09,681 INFO L225 Difference]: With dead ends: 3216 [2023-11-29 00:51:09,681 INFO L226 Difference]: Without dead ends: 3216 [2023-11-29 00:51:09,681 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 00:51:09,683 INFO L413 NwaCegarLoop]: 2263 mSDtfsCounter, 4025 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4528 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:09,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4528 Valid, 2324 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-11-29 00:51:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2023-11-29 00:51:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 1949. [2023-11-29 00:51:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 936 states have (on average 2.1346153846153846) internal successors, (1998), 1942 states have internal predecessors, (1998), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-11-29 00:51:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 3006 transitions. [2023-11-29 00:51:10,045 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 3006 transitions. Word has length 6 [2023-11-29 00:51:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:10,046 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 3006 transitions. [2023-11-29 00:51:10,046 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 00:51:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 3006 transitions. [2023-11-29 00:51:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:51:10,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:10,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:51:10,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:10,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:10,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:10,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:10,251 INFO L85 PathProgramCache]: Analyzing trace with hash 201214843, now seen corresponding path program 1 times [2023-11-29 00:51:10,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:10,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807576314] [2023-11-29 00:51:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:10,252 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 00:51:10,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:10,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:10,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:10,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:51:10,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:10,354 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 00:51:10,363 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 00:51:10,364 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:10,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:10,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807576314] [2023-11-29 00:51:10,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807576314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:10,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:10,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:51:10,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843754759] [2023-11-29 00:51:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:10,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:51:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:51:10,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:51:10,365 INFO L87 Difference]: Start difference. First operand 1949 states and 3006 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 00:51:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:13,444 INFO L93 Difference]: Finished difference Result 3092 states and 5171 transitions. [2023-11-29 00:51:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:51:13,446 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 00:51:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:13,464 INFO L225 Difference]: With dead ends: 3092 [2023-11-29 00:51:13,465 INFO L226 Difference]: Without dead ends: 3092 [2023-11-29 00:51:13,465 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 00:51:13,466 INFO L413 NwaCegarLoop]: 4628 mSDtfsCounter, 1722 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2225 SdHoareTripleChecker+Valid, 6849 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:13,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2225 Valid, 6849 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 00:51:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2023-11-29 00:51:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 1902. [2023-11-29 00:51:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 936 states have (on average 2.0844017094017095) internal successors, (1951), 1895 states have internal predecessors, (1951), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-11-29 00:51:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2959 transitions. [2023-11-29 00:51:13,775 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2959 transitions. Word has length 7 [2023-11-29 00:51:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:13,776 INFO L495 AbstractCegarLoop]: Abstraction has 1902 states and 2959 transitions. [2023-11-29 00:51:13,776 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 00:51:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2959 transitions. [2023-11-29 00:51:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:51:13,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:13,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:51:13,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:13,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:13,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:13,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash 201214844, now seen corresponding path program 1 times [2023-11-29 00:51:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166977851] [2023-11-29 00:51:13,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:13,983 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 00:51:13,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:13,984 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:13,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:14,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:51:14,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:14,139 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 00:51:14,163 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 00:51:14,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:14,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:14,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166977851] [2023-11-29 00:51:14,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166977851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:14,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:14,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:51:14,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797830442] [2023-11-29 00:51:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:14,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:51:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:14,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:51:14,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:51:14,166 INFO L87 Difference]: Start difference. First operand 1902 states and 2959 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 00:51:19,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:19,121 INFO L93 Difference]: Finished difference Result 3150 states and 5232 transitions. [2023-11-29 00:51:19,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:51:19,122 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 00:51:19,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:19,141 INFO L225 Difference]: With dead ends: 3150 [2023-11-29 00:51:19,142 INFO L226 Difference]: Without dead ends: 3150 [2023-11-29 00:51:19,142 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 00:51:19,143 INFO L413 NwaCegarLoop]: 4776 mSDtfsCounter, 1440 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 7122 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:19,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 7122 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-11-29 00:51:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2023-11-29 00:51:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 1915. [2023-11-29 00:51:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 959 states have (on average 2.0834202294056308) internal successors, (1998), 1908 states have internal predecessors, (1998), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2023-11-29 00:51:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 3006 transitions. [2023-11-29 00:51:19,557 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 3006 transitions. Word has length 7 [2023-11-29 00:51:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:19,557 INFO L495 AbstractCegarLoop]: Abstraction has 1915 states and 3006 transitions. [2023-11-29 00:51:19,557 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 00:51:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 3006 transitions. [2023-11-29 00:51:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 00:51:19,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:19,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:51:19,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:19,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:19,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr429REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:19,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2117834795, now seen corresponding path program 1 times [2023-11-29 00:51:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659521305] [2023-11-29 00:51:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:19,761 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 00:51:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:19,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:19,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:19,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:51:19,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:20,038 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 00:51:20,038 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:20,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:20,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659521305] [2023-11-29 00:51:20,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659521305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:20,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:20,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:51:20,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941774545] [2023-11-29 00:51:20,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:20,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:51:20,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:20,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:51:20,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:51:20,041 INFO L87 Difference]: Start difference. First operand 1915 states and 3006 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:51:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:21,756 INFO L93 Difference]: Finished difference Result 3336 states and 5463 transitions. [2023-11-29 00:51:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:51:21,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 00:51:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:21,780 INFO L225 Difference]: With dead ends: 3336 [2023-11-29 00:51:21,780 INFO L226 Difference]: Without dead ends: 3336 [2023-11-29 00:51:21,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 00:51:21,782 INFO L413 NwaCegarLoop]: 2882 mSDtfsCounter, 1506 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 5583 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:21,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 5583 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 00:51:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2023-11-29 00:51:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3059. [2023-11-29 00:51:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 1603 states have (on average 2.036805988771054) internal successors, (3265), 3052 states have internal predecessors, (3265), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:51:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 5273 transitions. [2023-11-29 00:51:22,306 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 5273 transitions. Word has length 10 [2023-11-29 00:51:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:22,306 INFO L495 AbstractCegarLoop]: Abstraction has 3059 states and 5273 transitions. [2023-11-29 00:51:22,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:51:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 5273 transitions. [2023-11-29 00:51:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 00:51:22,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:22,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:51:22,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 00:51:22,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:22,512 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:22,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:22,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1662980889, now seen corresponding path program 1 times [2023-11-29 00:51:22,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:22,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659710452] [2023-11-29 00:51:22,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:22,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:51:22,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:22,515 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:22,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:22,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:51:22,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:22,709 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 00:51:22,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:22,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:22,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659710452] [2023-11-29 00:51:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659710452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:22,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:51:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093761634] [2023-11-29 00:51:22,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:22,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:51:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:51:22,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:51:22,712 INFO L87 Difference]: Start difference. First operand 3059 states and 5273 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:51:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:23,867 INFO L93 Difference]: Finished difference Result 3005 states and 5193 transitions. [2023-11-29 00:51:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:51:23,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 00:51:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:23,897 INFO L225 Difference]: With dead ends: 3005 [2023-11-29 00:51:23,898 INFO L226 Difference]: Without dead ends: 3005 [2023-11-29 00:51:23,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 00:51:23,899 INFO L413 NwaCegarLoop]: 2785 mSDtfsCounter, 70 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 5521 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:23,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 5521 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 00:51:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2023-11-29 00:51:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 3005. [2023-11-29 00:51:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3005 states, 1573 states have (on average 2.024793388429752) internal successors, (3185), 2998 states have internal predecessors, (3185), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:51:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 5193 transitions. [2023-11-29 00:51:24,286 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 5193 transitions. Word has length 12 [2023-11-29 00:51:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:24,287 INFO L495 AbstractCegarLoop]: Abstraction has 3005 states and 5193 transitions. [2023-11-29 00:51:24,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:51:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 5193 transitions. [2023-11-29 00:51:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:51:24,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:24,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:51:24,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-29 00:51:24,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:24,489 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr533ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:24,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash 663295513, now seen corresponding path program 1 times [2023-11-29 00:51:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:24,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049271370] [2023-11-29 00:51:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:24,491 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 00:51:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:24,492 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:24,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:24,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:51:24,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:24,703 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:51:24,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:51:24,705 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:51:24,710 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 00:51:24,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:51:24,779 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 00:51:24,797 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 00:51:24,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:24,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:24,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049271370] [2023-11-29 00:51:24,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049271370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:24,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:24,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:51:24,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245354568] [2023-11-29 00:51:24,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:24,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:51:24,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:24,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:51:24,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:51:24,800 INFO L87 Difference]: Start difference. First operand 3005 states and 5193 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:51:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:29,889 INFO L93 Difference]: Finished difference Result 5746 states and 9936 transitions. [2023-11-29 00:51:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:51:29,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 00:51:29,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:29,914 INFO L225 Difference]: With dead ends: 5746 [2023-11-29 00:51:29,914 INFO L226 Difference]: Without dead ends: 5746 [2023-11-29 00:51:29,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 00:51:29,915 INFO L413 NwaCegarLoop]: 3206 mSDtfsCounter, 1841 mSDsluCounter, 5487 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2344 SdHoareTripleChecker+Valid, 8693 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:29,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2344 Valid, 8693 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-11-29 00:51:29,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5746 states. [2023-11-29 00:51:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5746 to 3004. [2023-11-29 00:51:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 1572 states have (on average 2.0248091603053435) internal successors, (3183), 2997 states have internal predecessors, (3183), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:51:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 5191 transitions. [2023-11-29 00:51:30,382 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 5191 transitions. Word has length 13 [2023-11-29 00:51:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:30,382 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 5191 transitions. [2023-11-29 00:51:30,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:51:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 5191 transitions. [2023-11-29 00:51:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:51:30,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:30,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:51:30,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:30,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:30,588 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:30,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:30,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1630724626, now seen corresponding path program 1 times [2023-11-29 00:51:30,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:30,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186937633] [2023-11-29 00:51:30,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:30,589 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 00:51:30,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:30,590 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:30,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:30,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:51:30,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:30,741 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 00:51:30,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:30,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:30,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186937633] [2023-11-29 00:51:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186937633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:30,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:30,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:51:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240460835] [2023-11-29 00:51:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:30,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:51:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:30,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:51:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:51:30,743 INFO L87 Difference]: Start difference. First operand 3004 states and 5191 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 00:51:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:31,515 INFO L93 Difference]: Finished difference Result 2950 states and 5111 transitions. [2023-11-29 00:51:31,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:51:31,526 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 00:51:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:31,536 INFO L225 Difference]: With dead ends: 2950 [2023-11-29 00:51:31,536 INFO L226 Difference]: Without dead ends: 2950 [2023-11-29 00:51:31,536 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 00:51:31,537 INFO L413 NwaCegarLoop]: 2748 mSDtfsCounter, 70 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 5447 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:31,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 5447 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 00:51:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2023-11-29 00:51:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2950. [2023-11-29 00:51:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 1542 states have (on average 2.0123216601815823) internal successors, (3103), 2943 states have internal predecessors, (3103), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:51:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 5111 transitions. [2023-11-29 00:51:31,821 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 5111 transitions. Word has length 15 [2023-11-29 00:51:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:31,821 INFO L495 AbstractCegarLoop]: Abstraction has 2950 states and 5111 transitions. [2023-11-29 00:51:31,821 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 00:51:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 5111 transitions. [2023-11-29 00:51:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:51:31,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:31,822 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 00:51:31,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:32,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:32,023 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:32,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:32,023 INFO L85 PathProgramCache]: Analyzing trace with hash -536699924, now seen corresponding path program 1 times [2023-11-29 00:51:32,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:32,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253502351] [2023-11-29 00:51:32,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:32,024 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 00:51:32,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:32,025 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:32,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:32,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:51:32,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:32,180 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 00:51:32,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:32,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:32,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253502351] [2023-11-29 00:51:32,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253502351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:32,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:32,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:51:32,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978012055] [2023-11-29 00:51:32,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:32,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:51:32,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:32,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:51:32,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:51:32,182 INFO L87 Difference]: Start difference. First operand 2950 states and 5111 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 00:51:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:33,163 INFO L93 Difference]: Finished difference Result 2936 states and 5069 transitions. [2023-11-29 00:51:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:51:33,165 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 00:51:33,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:33,175 INFO L225 Difference]: With dead ends: 2936 [2023-11-29 00:51:33,175 INFO L226 Difference]: Without dead ends: 2936 [2023-11-29 00:51:33,175 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 00:51:33,176 INFO L413 NwaCegarLoop]: 2717 mSDtfsCounter, 58 mSDsluCounter, 5410 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 8127 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:33,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 8127 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:51:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2023-11-29 00:51:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2934. [2023-11-29 00:51:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 1540 states have (on average 1.9863636363636363) internal successors, (3059), 2927 states have internal predecessors, (3059), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:51:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5067 transitions. [2023-11-29 00:51:33,473 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5067 transitions. Word has length 17 [2023-11-29 00:51:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:33,474 INFO L495 AbstractCegarLoop]: Abstraction has 2934 states and 5067 transitions. [2023-11-29 00:51:33,474 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 00:51:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5067 transitions. [2023-11-29 00:51:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:51:33,475 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:33,475 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 00:51:33,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:33,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:33,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:33,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1997082330, now seen corresponding path program 1 times [2023-11-29 00:51:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:33,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857639972] [2023-11-29 00:51:33,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:33,678 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 00:51:33,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:33,679 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:33,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:33,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:51:33,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:33,867 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 00:51:33,957 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 00:51:33,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:33,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:33,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857639972] [2023-11-29 00:51:33,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857639972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:33,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:33,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:51:33,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793768365] [2023-11-29 00:51:33,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:33,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:51:33,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:33,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:51:33,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:51:33,959 INFO L87 Difference]: Start difference. First operand 2934 states and 5067 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 00:51:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:38,138 INFO L93 Difference]: Finished difference Result 5138 states and 9327 transitions. [2023-11-29 00:51:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:51:38,139 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 00:51:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:38,155 INFO L225 Difference]: With dead ends: 5138 [2023-11-29 00:51:38,155 INFO L226 Difference]: Without dead ends: 5138 [2023-11-29 00:51:38,155 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 00:51:38,156 INFO L413 NwaCegarLoop]: 2469 mSDtfsCounter, 1615 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2118 SdHoareTripleChecker+Valid, 5512 SdHoareTripleChecker+Invalid, 2514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:38,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2118 Valid, 5512 Invalid, 2514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 00:51:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2023-11-29 00:51:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 2930. [2023-11-29 00:51:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2930 states, 1540 states have (on average 1.9811688311688311) internal successors, (3051), 2923 states have internal predecessors, (3051), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:51:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 5059 transitions. [2023-11-29 00:51:38,758 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 5059 transitions. Word has length 31 [2023-11-29 00:51:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:38,759 INFO L495 AbstractCegarLoop]: Abstraction has 2930 states and 5059 transitions. [2023-11-29 00:51:38,759 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 00:51:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 5059 transitions. [2023-11-29 00:51:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:51:38,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:38,760 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 00:51:38,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:51:38,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:38,961 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:38,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1997082331, now seen corresponding path program 1 times [2023-11-29 00:51:38,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:38,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198023152] [2023-11-29 00:51:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:38,962 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 00:51:38,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:38,964 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:38,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:39,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:51:39,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:39,183 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 00:51:39,384 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 00:51:39,384 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:39,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:39,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198023152] [2023-11-29 00:51:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198023152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:39,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:51:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625113958] [2023-11-29 00:51:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:39,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:51:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:39,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:51:39,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:51:39,388 INFO L87 Difference]: Start difference. First operand 2930 states and 5059 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 00:51:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:45,308 INFO L93 Difference]: Finished difference Result 5179 states and 9333 transitions. [2023-11-29 00:51:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:51:45,308 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 00:51:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:45,325 INFO L225 Difference]: With dead ends: 5179 [2023-11-29 00:51:45,325 INFO L226 Difference]: Without dead ends: 5179 [2023-11-29 00:51:45,325 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 00:51:45,326 INFO L413 NwaCegarLoop]: 4749 mSDtfsCounter, 1335 mSDsluCounter, 5735 mSDsCounter, 0 mSdLazyCounter, 2681 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1835 SdHoareTripleChecker+Valid, 10484 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:45,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1835 Valid, 10484 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2681 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-11-29 00:51:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2023-11-29 00:51:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 2926. [2023-11-29 00:51:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 1540 states have (on average 1.975974025974026) internal successors, (3043), 2919 states have internal predecessors, (3043), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:51:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 5051 transitions. [2023-11-29 00:51:45,829 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 5051 transitions. Word has length 31 [2023-11-29 00:51:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:45,830 INFO L495 AbstractCegarLoop]: Abstraction has 2926 states and 5051 transitions. [2023-11-29 00:51:45,830 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 00:51:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 5051 transitions. [2023-11-29 00:51:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 00:51:45,832 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:45,832 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] [2023-11-29 00:51:45,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:46,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:46,035 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:46,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:46,036 INFO L85 PathProgramCache]: Analyzing trace with hash 754494999, now seen corresponding path program 1 times [2023-11-29 00:51:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:46,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702291103] [2023-11-29 00:51:46,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:46,037 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 00:51:46,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:46,038 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:46,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:46,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:51:46,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:46,308 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 00:51:46,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:46,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702291103] [2023-11-29 00:51:46,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702291103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:46,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:46,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:51:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734424976] [2023-11-29 00:51:46,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:46,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:51:46,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:46,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:51:46,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:51:46,310 INFO L87 Difference]: Start difference. First operand 2926 states and 5051 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 00:51:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:47,237 INFO L93 Difference]: Finished difference Result 2914 states and 5031 transitions. [2023-11-29 00:51:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:51:47,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2023-11-29 00:51:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:47,248 INFO L225 Difference]: With dead ends: 2914 [2023-11-29 00:51:47,248 INFO L226 Difference]: Without dead ends: 2914 [2023-11-29 00:51:47,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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 00:51:47,249 INFO L413 NwaCegarLoop]: 2711 mSDtfsCounter, 23 mSDsluCounter, 5402 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8113 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:47,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8113 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:51:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2023-11-29 00:51:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2914. [2023-11-29 00:51:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 1528 states have (on average 1.9784031413612566) internal successors, (3023), 2907 states have internal predecessors, (3023), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:51:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5031 transitions. [2023-11-29 00:51:47,608 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5031 transitions. Word has length 50 [2023-11-29 00:51:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:47,608 INFO L495 AbstractCegarLoop]: Abstraction has 2914 states and 5031 transitions. [2023-11-29 00:51:47,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 00:51:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5031 transitions. [2023-11-29 00:51:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 00:51:47,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:47,610 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 00:51:47,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:47,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:47,811 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:47,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1137060331, now seen corresponding path program 1 times [2023-11-29 00:51:47,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:47,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806968032] [2023-11-29 00:51:47,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:47,812 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 00:51:47,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:47,813 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:47,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:48,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:51:48,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:48,122 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 00:51:48,127 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 00:51:48,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:51:48,611 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 00:51:48,625 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:51:48,626 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 00:51:48,643 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 00:51:48,643 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:48,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:48,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806968032] [2023-11-29 00:51:48,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806968032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:48,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:48,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:51:48,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303886118] [2023-11-29 00:51:48,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:48,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:51:48,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:48,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:51:48,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:51:48,645 INFO L87 Difference]: Start difference. First operand 2914 states and 5031 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 00:51:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:53,987 INFO L93 Difference]: Finished difference Result 5084 states and 9261 transitions. [2023-11-29 00:51:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:51:53,987 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 00:51:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:53,997 INFO L225 Difference]: With dead ends: 5084 [2023-11-29 00:51:53,998 INFO L226 Difference]: Without dead ends: 5084 [2023-11-29 00:51:53,998 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 00:51:53,998 INFO L413 NwaCegarLoop]: 2346 mSDtfsCounter, 4201 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5204 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:53,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5204 Valid, 3524 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-11-29 00:51:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5084 states. [2023-11-29 00:51:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5084 to 2853. [2023-11-29 00:51:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 1505 states have (on average 1.9455149501661129) internal successors, (2928), 2846 states have internal predecessors, (2928), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:51:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4936 transitions. [2023-11-29 00:51:54,448 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4936 transitions. Word has length 54 [2023-11-29 00:51:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:54,449 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 4936 transitions. [2023-11-29 00:51:54,449 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 00:51:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4936 transitions. [2023-11-29 00:51:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 00:51:54,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:54,450 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 00:51:54,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:54,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:54,650 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:54,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:54,651 INFO L85 PathProgramCache]: Analyzing trace with hash -339363823, now seen corresponding path program 1 times [2023-11-29 00:51:54,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:54,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768814380] [2023-11-29 00:51:54,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:54,652 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 00:51:54,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:54,653 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:54,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:54,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:51:54,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:54,889 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 00:51:54,902 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 00:51:54,923 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 00:51:54,933 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 00:51:54,934 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:54,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:54,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768814380] [2023-11-29 00:51:54,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768814380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:54,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:54,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:51:54,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278843249] [2023-11-29 00:51:54,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:54,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:51:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:54,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:51:54,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:51:54,936 INFO L87 Difference]: Start difference. First operand 2853 states and 4936 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 00:51:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:51:57,521 INFO L93 Difference]: Finished difference Result 2852 states and 4935 transitions. [2023-11-29 00:51:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:51:57,522 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 00:51:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:51:57,527 INFO L225 Difference]: With dead ends: 2852 [2023-11-29 00:51:57,527 INFO L226 Difference]: Without dead ends: 2852 [2023-11-29 00:51:57,527 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 00:51:57,528 INFO L413 NwaCegarLoop]: 2685 mSDtfsCounter, 3 mSDsluCounter, 7102 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9787 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:51:57,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 9787 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 00:51:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2023-11-29 00:51:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2023-11-29 00:51:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 1505 states have (on average 1.9448504983388704) internal successors, (2927), 2845 states have internal predecessors, (2927), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:51:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4935 transitions. [2023-11-29 00:51:57,793 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4935 transitions. Word has length 58 [2023-11-29 00:51:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:51:57,794 INFO L495 AbstractCegarLoop]: Abstraction has 2852 states and 4935 transitions. [2023-11-29 00:51:57,794 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 00:51:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4935 transitions. [2023-11-29 00:51:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 00:51:57,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:51:57,794 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 00:51:57,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:57,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:57,995 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:51:57,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:51:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash -339363822, now seen corresponding path program 1 times [2023-11-29 00:51:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:51:57,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865048407] [2023-11-29 00:51:57,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:51:57,996 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 00:51:57,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:51:57,997 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:57,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:51:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:51:58,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:51:58,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:51:58,242 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 00:51:58,264 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 00:51:58,269 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 00:51:58,307 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 00:51:58,325 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 00:51:58,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:51:58,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:51:58,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865048407] [2023-11-29 00:51:58,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865048407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:51:58,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:51:58,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:51:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100696402] [2023-11-29 00:51:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:51:58,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:51:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:51:58,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:51:58,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:51:58,327 INFO L87 Difference]: Start difference. First operand 2852 states and 4935 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 00:52:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:52:01,561 INFO L93 Difference]: Finished difference Result 2851 states and 4934 transitions. [2023-11-29 00:52:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:52:01,562 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 00:52:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:52:01,569 INFO L225 Difference]: With dead ends: 2851 [2023-11-29 00:52:01,569 INFO L226 Difference]: Without dead ends: 2851 [2023-11-29 00:52:01,569 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 00:52:01,570 INFO L413 NwaCegarLoop]: 2685 mSDtfsCounter, 1 mSDsluCounter, 7136 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9821 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:52:01,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9821 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 00:52:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2023-11-29 00:52:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2851. [2023-11-29 00:52:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 1504 states have (on average 1.9454787234042554) internal successors, (2926), 2844 states have internal predecessors, (2926), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2023-11-29 00:52:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 4934 transitions. [2023-11-29 00:52:01,792 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 4934 transitions. Word has length 58 [2023-11-29 00:52:01,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:52:01,792 INFO L495 AbstractCegarLoop]: Abstraction has 2851 states and 4934 transitions. [2023-11-29 00:52:01,792 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 00:52:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 4934 transitions. [2023-11-29 00:52:01,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 00:52:01,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:52:01,793 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 00:52:01,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 00:52:01,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:01,994 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:52:01,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:52:01,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1600186485, now seen corresponding path program 1 times [2023-11-29 00:52:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:52:01,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617196202] [2023-11-29 00:52:01,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:52:01,995 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 00:52:01,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:52:01,996 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:01,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:52:02,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:52:02,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:52:02,297 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 00:52:02,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:52:02,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:52:02,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617196202] [2023-11-29 00:52:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617196202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:52:02,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:52:02,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:52:02,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758466608] [2023-11-29 00:52:02,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:52:02,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:52:02,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:52:02,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:52:02,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:52:02,300 INFO L87 Difference]: Start difference. First operand 2851 states and 4934 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 00:52:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:52:03,272 INFO L93 Difference]: Finished difference Result 2853 states and 4937 transitions. [2023-11-29 00:52:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:52:03,274 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 00:52:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:52:03,282 INFO L225 Difference]: With dead ends: 2853 [2023-11-29 00:52:03,282 INFO L226 Difference]: Without dead ends: 2853 [2023-11-29 00:52:03,282 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 00:52:03,282 INFO L413 NwaCegarLoop]: 2685 mSDtfsCounter, 1 mSDsluCounter, 5367 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8052 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:52:03,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8052 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:52:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2023-11-29 00:52:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2853. [2023-11-29 00:52:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 1505 states have (on average 1.9455149501661129) internal successors, (2928), 2846 states have internal predecessors, (2928), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 00:52:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4937 transitions. [2023-11-29 00:52:03,512 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4937 transitions. Word has length 64 [2023-11-29 00:52:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:52:03,513 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 4937 transitions. [2023-11-29 00:52:03,513 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 00:52:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4937 transitions. [2023-11-29 00:52:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 00:52:03,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:52:03,513 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 00:52:03,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:03,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:03,714 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:52:03,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:52:03,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1393105625, now seen corresponding path program 1 times [2023-11-29 00:52:03,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:52:03,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83888242] [2023-11-29 00:52:03,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:52:03,716 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 00:52:03,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:52:03,717 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:03,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:52:04,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:52:04,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:52:04,087 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 00:52:04,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:52:04,148 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 00:52:04,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:52:04,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83888242] [2023-11-29 00:52:04,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83888242] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:52:04,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:52:04,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 00:52:04,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733536528] [2023-11-29 00:52:04,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:52:04,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:52:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:52:04,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:52:04,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:52:04,151 INFO L87 Difference]: Start difference. First operand 2853 states and 4937 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 00:52:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:52:05,756 INFO L93 Difference]: Finished difference Result 2862 states and 4951 transitions. [2023-11-29 00:52:05,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:52:05,757 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 00:52:05,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:52:05,765 INFO L225 Difference]: With dead ends: 2862 [2023-11-29 00:52:05,766 INFO L226 Difference]: Without dead ends: 2862 [2023-11-29 00:52:05,766 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 00:52:05,766 INFO L413 NwaCegarLoop]: 2684 mSDtfsCounter, 6 mSDsluCounter, 13411 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16095 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:52:05,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16095 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 00:52:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2023-11-29 00:52:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2861. [2023-11-29 00:52:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 1512 states have (on average 1.94510582010582) internal successors, (2941), 2853 states have internal predecessors, (2941), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 00:52:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4950 transitions. [2023-11-29 00:52:06,058 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4950 transitions. Word has length 65 [2023-11-29 00:52:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:52:06,059 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 4950 transitions. [2023-11-29 00:52:06,059 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 00:52:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4950 transitions. [2023-11-29 00:52:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 00:52:06,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:52:06,060 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 00:52:06,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-29 00:52:06,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:06,261 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:52:06,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:52:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash 324240629, now seen corresponding path program 2 times [2023-11-29 00:52:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:52:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209295848] [2023-11-29 00:52:06,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:52:06,262 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 00:52:06,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:52:06,264 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:06,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:06,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:52:06,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:52:06,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:52:06,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:52:06,756 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 00:52:06,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:52:06,905 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 00:52:06,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:52:06,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209295848] [2023-11-29 00:52:06,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209295848] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:52:06,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:52:06,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 00:52:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143555594] [2023-11-29 00:52:06,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:52:06,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 00:52:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:52:06,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:52:06,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:52:06,908 INFO L87 Difference]: Start difference. First operand 2861 states and 4950 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 00:52:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:52:09,840 INFO L93 Difference]: Finished difference Result 2876 states and 4972 transitions. [2023-11-29 00:52:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 00:52:09,841 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 00:52:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:52:09,849 INFO L225 Difference]: With dead ends: 2876 [2023-11-29 00:52:09,849 INFO L226 Difference]: Without dead ends: 2874 [2023-11-29 00:52:09,850 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 00:52:09,850 INFO L413 NwaCegarLoop]: 2684 mSDtfsCounter, 13 mSDsluCounter, 21460 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 24144 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:52:09,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 24144 Invalid, 1052 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 00:52:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2023-11-29 00:52:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2870. [2023-11-29 00:52:10,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2870 states, 1521 states have (on average 1.9414858645627877) internal successors, (2953), 2862 states have internal predecessors, (2953), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 00:52:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 4962 transitions. [2023-11-29 00:52:10,184 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 4962 transitions. Word has length 68 [2023-11-29 00:52:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:52:10,184 INFO L495 AbstractCegarLoop]: Abstraction has 2870 states and 4962 transitions. [2023-11-29 00:52:10,184 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 00:52:10,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 4962 transitions. [2023-11-29 00:52:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 00:52:10,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:52:10,185 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 00:52:10,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:52:10,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:10,386 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:52:10,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:52:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash -913754187, now seen corresponding path program 3 times [2023-11-29 00:52:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:52:10,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627507830] [2023-11-29 00:52:10,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:52:10,387 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 00:52:10,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:52:10,388 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:10,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:11,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 00:52:11,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:52:11,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:52:11,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:52:11,197 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 00:52:11,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:52:11,734 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 00:52:11,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:52:11,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627507830] [2023-11-29 00:52:11,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627507830] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:52:11,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:52:11,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 00:52:11,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74376451] [2023-11-29 00:52:11,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:52:11,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 00:52:11,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:52:11,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:52:11,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 00:52:11,736 INFO L87 Difference]: Start difference. First operand 2870 states and 4962 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 00:52:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:52:17,327 INFO L93 Difference]: Finished difference Result 2900 states and 5012 transitions. [2023-11-29 00:52:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 00:52:17,328 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 00:52:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:52:17,337 INFO L225 Difference]: With dead ends: 2900 [2023-11-29 00:52:17,337 INFO L226 Difference]: Without dead ends: 2897 [2023-11-29 00:52:17,338 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 00:52:17,339 INFO L413 NwaCegarLoop]: 2683 mSDtfsCounter, 25 mSDsluCounter, 32180 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 34863 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:52:17,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 34863 Invalid, 1955 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 00:52:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2023-11-29 00:52:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2888. [2023-11-29 00:52:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 1539 states have (on average 1.9337231968810915) internal successors, (2976), 2880 states have internal predecessors, (2976), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 00:52:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4985 transitions. [2023-11-29 00:52:17,688 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4985 transitions. Word has length 74 [2023-11-29 00:52:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:52:17,689 INFO L495 AbstractCegarLoop]: Abstraction has 2888 states and 4985 transitions. [2023-11-29 00:52:17,689 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 00:52:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4985 transitions. [2023-11-29 00:52:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:52:17,690 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:52:17,690 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 00:52:17,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:17,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:17,898 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:52:17,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:52:17,899 INFO L85 PathProgramCache]: Analyzing trace with hash 291335477, now seen corresponding path program 4 times [2023-11-29 00:52:17,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:52:17,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998670288] [2023-11-29 00:52:17,900 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:52:17,900 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 00:52:17,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:52:17,901 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:17,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:18,288 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:52:18,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:52:18,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 00:52:18,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:52:18,682 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 00:52:18,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:52:20,235 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 00:52:20,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:52:20,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998670288] [2023-11-29 00:52:20,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998670288] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:52:20,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:52:20,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 00:52:20,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357335127] [2023-11-29 00:52:20,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:52:20,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 00:52:20,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:52:20,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 00:52:20,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 00:52:20,239 INFO L87 Difference]: Start difference. First operand 2888 states and 4985 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 00:52:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:52:34,558 INFO L93 Difference]: Finished difference Result 2945 states and 5074 transitions. [2023-11-29 00:52:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 00:52:34,559 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 00:52:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:52:34,566 INFO L225 Difference]: With dead ends: 2945 [2023-11-29 00:52:34,566 INFO L226 Difference]: Without dead ends: 2943 [2023-11-29 00:52:34,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 00:52:34,572 INFO L413 NwaCegarLoop]: 2684 mSDtfsCounter, 47 mSDsluCounter, 75119 mSDsCounter, 0 mSdLazyCounter, 5166 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 77803 SdHoareTripleChecker+Invalid, 5222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 5166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:52:34,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 77803 Invalid, 5222 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [56 Valid, 5166 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2023-11-29 00:52:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2023-11-29 00:52:34,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2922. [2023-11-29 00:52:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 1573 states have (on average 1.9211697393515574) internal successors, (3022), 2914 states have internal predecessors, (3022), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 00:52:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 5031 transitions. [2023-11-29 00:52:34,898 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 5031 transitions. Word has length 86 [2023-11-29 00:52:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:52:34,898 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 5031 transitions. [2023-11-29 00:52:34,899 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 00:52:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 5031 transitions. [2023-11-29 00:52:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:52:34,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:52:34,899 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 00:52:34,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 00:52:35,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:35,100 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:52:35,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:52:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash 378659317, now seen corresponding path program 5 times [2023-11-29 00:52:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:52:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586602318] [2023-11-29 00:52:35,101 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:52:35,102 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 00:52:35,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:52:35,102 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:52:35,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 00:52:36,535 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:52:36,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:52:36,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 00:52:36,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:52:36,579 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 00:52:36,682 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:52:36,682 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 00:52:36,709 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 00:52:36,785 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 00:52:37,728 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:52:37,728 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 00:52:37,777 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 00:52:37,818 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 00:52:37,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:52:42,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:52:42,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586602318] [2023-11-29 00:52:42,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586602318] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:52:42,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1716486479] [2023-11-29 00:52:42,316 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:52:42,316 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:52:42,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:52:42,317 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:52:42,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-11-29 00:53:55,240 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:53:55,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:53:55,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 00:53:55,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:53:55,478 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 00:53:55,778 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:53:55,779 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 00:53:55,837 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 00:53:55,993 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 00:53:56,982 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:53:56,982 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 00:53:57,079 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 00:53:57,088 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 00:53:57,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:54:01,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1716486479] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:54:01,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:54:01,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 00:54:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712818190] [2023-11-29 00:54:01,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:54:01,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:54:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:01,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:54:01,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=185, Unknown=2, NotChecked=0, Total=240 [2023-11-29 00:54:01,479 INFO L87 Difference]: Start difference. First operand 2922 states and 5031 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 00:54:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:20,322 INFO L93 Difference]: Finished difference Result 5131 states and 9298 transitions. [2023-11-29 00:54:20,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:54:20,323 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 00:54:20,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:20,336 INFO L225 Difference]: With dead ends: 5131 [2023-11-29 00:54:20,337 INFO L226 Difference]: Without dead ends: 5129 [2023-11-29 00:54:20,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=62, Invalid=208, Unknown=2, NotChecked=0, Total=272 [2023-11-29 00:54:20,337 INFO L413 NwaCegarLoop]: 2460 mSDtfsCounter, 1507 mSDsluCounter, 8846 mSDsCounter, 0 mSdLazyCounter, 7437 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2009 SdHoareTripleChecker+Valid, 11306 SdHoareTripleChecker+Invalid, 7443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:20,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2009 Valid, 11306 Invalid, 7443 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 7437 Invalid, 0 Unknown, 0 Unchecked, 18.5s Time] [2023-11-29 00:54:20,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2023-11-29 00:54:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 2921. [2023-11-29 00:54:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 1573 states have (on average 1.9179910998092817) internal successors, (3017), 2913 states have internal predecessors, (3017), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 00:54:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 5026 transitions. [2023-11-29 00:54:21,009 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 5026 transitions. Word has length 108 [2023-11-29 00:54:21,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:21,009 INFO L495 AbstractCegarLoop]: Abstraction has 2921 states and 5026 transitions. [2023-11-29 00:54:21,009 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 00:54:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 5026 transitions. [2023-11-29 00:54:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:54:21,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:21,011 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 00:54:21,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2023-11-29 00:54:21,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 00:54:21,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:54:21,411 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:54:21,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash 378659318, now seen corresponding path program 1 times [2023-11-29 00:54:21,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:21,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980678958] [2023-11-29 00:54:21,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:21,413 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 00:54:21,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:21,414 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:54:21,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-29 00:54:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:22,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 00:54:22,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:22,109 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 00:54:22,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:54:22,405 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:54:22,406 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 00:54:22,439 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 00:54:22,450 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 00:54:22,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:54:22,591 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 00:54:23,392 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:54:23,392 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 00:54:23,399 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 00:54:23,457 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 00:54:23,463 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 00:54:23,498 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 00:54:23,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:54:24,873 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3012 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3013) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:54:24,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980678958] [2023-11-29 00:54:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980678958] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:54:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [180958248] [2023-11-29 00:54:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:24,880 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:54:24,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:54:24,881 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:54:24,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-11-29 00:56:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:56:10,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 00:56:10,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:10,886 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 00:56:11,226 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:56:11,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:56:11,235 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 00:56:11,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:56:11,265 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 00:56:11,346 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 00:56:11,352 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 00:56:12,263 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:56:12,263 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 00:56:12,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 00:56:12,341 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 00:56:12,347 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 00:56:12,352 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 00:56:12,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:13,686 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3568 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:56:13,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [180958248] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:56:13,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:56:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 00:56:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577246279] [2023-11-29 00:56:13,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:56:13,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:56:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:56:13,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:56:13,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 00:56:13,693 INFO L87 Difference]: Start difference. First operand 2921 states and 5026 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 00:56:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:56:27,550 INFO L93 Difference]: Finished difference Result 5128 states and 9293 transitions. [2023-11-29 00:56:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:56:27,551 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 00:56:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:56:27,561 INFO L225 Difference]: With dead ends: 5128 [2023-11-29 00:56:27,561 INFO L226 Difference]: Without dead ends: 5128 [2023-11-29 00:56:27,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 00:56:27,562 INFO L413 NwaCegarLoop]: 2485 mSDtfsCounter, 1461 mSDsluCounter, 11047 mSDsCounter, 0 mSdLazyCounter, 5591 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1963 SdHoareTripleChecker+Valid, 13532 SdHoareTripleChecker+Invalid, 5598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:56:27,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1963 Valid, 13532 Invalid, 5598 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 5591 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2023-11-29 00:56:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5128 states. [2023-11-29 00:56:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5128 to 2920. [2023-11-29 00:56:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 1573 states have (on average 1.9173553719008265) internal successors, (3016), 2912 states have internal predecessors, (3016), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 00:56:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 5025 transitions. [2023-11-29 00:56:28,222 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 5025 transitions. Word has length 108 [2023-11-29 00:56:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:56:28,223 INFO L495 AbstractCegarLoop]: Abstraction has 2920 states and 5025 transitions. [2023-11-29 00:56:28,223 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 00:56:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 5025 transitions. [2023-11-29 00:56:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 00:56:28,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:56:28,224 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 00:56:28,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-11-29 00:56:28,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-11-29 00:56:28,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:56:28,625 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:56:28,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:56:28,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1175409833, now seen corresponding path program 1 times [2023-11-29 00:56:28,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:56:28,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125660528] [2023-11-29 00:56:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:56:28,628 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 00:56:28,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:56:28,628 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:56:28,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-29 00:56:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:56:29,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 00:56:29,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:29,395 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 00:56:29,555 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:56:29,555 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 00:56:29,585 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 00:56:29,695 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 00:56:30,677 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:56:30,678 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 00:56:30,791 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:56:30,792 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 00:56:30,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:56:30,851 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 00:56:30,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:34,990 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3992 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:56:35,468 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4038 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4038))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:56:35,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:56:35,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125660528] [2023-11-29 00:56:35,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125660528] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:56:35,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [195709915] [2023-11-29 00:56:35,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:56:35,471 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:56:35,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:56:35,472 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:56:35,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-11-29 00:56:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:56:39,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 00:56:39,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:39,550 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 00:56:39,931 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:56:39,931 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 00:56:40,012 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 00:56:40,208 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 00:56:41,072 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:56:41,072 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 00:56:41,239 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:56:41,240 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 00:56:41,253 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 00:56:41,263 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 00:56:41,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:41,281 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4462 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4462) |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 00:56:41,294 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4462 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:56:41,705 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4462 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4508))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4462)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:56:41,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [195709915] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:56:41,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:56:41,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 00:56:41,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617706725] [2023-11-29 00:56:41,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:56:41,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:56:41,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:56:41,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:56:41,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=244, Unknown=6, NotChecked=180, Total=506 [2023-11-29 00:56:41,710 INFO L87 Difference]: Start difference. First operand 2920 states and 5025 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 00:57:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:15,169 INFO L93 Difference]: Finished difference Result 5127 states and 9292 transitions. [2023-11-29 00:57:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:57:15,170 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 00:57:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:15,180 INFO L225 Difference]: With dead ends: 5127 [2023-11-29 00:57:15,180 INFO L226 Difference]: Without dead ends: 5127 [2023-11-29 00:57:15,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=85, Invalid=271, Unknown=6, NotChecked=190, Total=552 [2023-11-29 00:57:15,181 INFO L413 NwaCegarLoop]: 2459 mSDtfsCounter, 1500 mSDsluCounter, 13851 mSDsCounter, 0 mSdLazyCounter, 10558 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2002 SdHoareTripleChecker+Valid, 16310 SdHoareTripleChecker+Invalid, 10564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:15,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2002 Valid, 16310 Invalid, 10564 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 10558 Invalid, 0 Unknown, 0 Unchecked, 33.1s Time] [2023-11-29 00:57:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2023-11-29 00:57:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 2919. [2023-11-29 00:57:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 1573 states have (on average 1.9167196439923713) internal successors, (3015), 2911 states have internal predecessors, (3015), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 00:57:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 5024 transitions. [2023-11-29 00:57:15,833 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 5024 transitions. Word has length 110 [2023-11-29 00:57:15,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:15,834 INFO L495 AbstractCegarLoop]: Abstraction has 2919 states and 5024 transitions. [2023-11-29 00:57:15,834 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 00:57:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 5024 transitions. [2023-11-29 00:57:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 00:57:15,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:15,835 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 00:57:15,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-11-29 00:57:16,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-11-29 00:57:16,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:57:16,236 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:57:16,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1175409832, now seen corresponding path program 1 times [2023-11-29 00:57:16,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:16,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43296775] [2023-11-29 00:57:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:16,238 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 00:57:16,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:16,239 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:57:16,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-29 00:57:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:17,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 00:57:17,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:17,103 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 00:57:17,468 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 00:57:17,488 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:57:17,489 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 00:57:17,538 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 00:57:17,549 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 00:57:17,683 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 00:57:17,689 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 00:57:18,544 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:57:18,545 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 00:57:18,550 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 00:57:18,687 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:57:18,687 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 00:57:18,694 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 00:57:18,717 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 00:57:18,722 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 00:57:18,756 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 00:57:18,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:57:18,940 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4978) |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 00:57:18,995 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-11-29 00:57:20,540 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5071) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5070))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5071) .cse2 v_ArrVal_4978) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 00:57:20,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:20,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43296775] [2023-11-29 00:57:20,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43296775] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:57:20,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1889792379] [2023-11-29 00:57:20,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:20,549 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:57:20,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:57:20,550 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:57:20,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-11-29 00:57:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:24,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 00:57:24,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:24,719 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 00:57:24,976 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:57:24,977 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 00:57:24,985 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 00:57:24,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:57:25,009 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 00:57:25,074 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 00:57:25,078 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 00:57:25,680 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:57:25,680 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 00:57:25,688 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 00:57:25,783 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:57:25,783 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 00:57:25,791 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 00:57:25,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:57:25,809 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 00:57:25,816 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 00:57:25,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:57:25,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-11-29 00:57:25,896 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:57:27,273 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5634))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5635) .cse0 v_ArrVal_5543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5635) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-11-29 00:57:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1889792379] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:57:27,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:57:27,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 00:57:27,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971719997] [2023-11-29 00:57:27,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:57:27,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:57:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:57:27,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:57:27,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2023-11-29 00:57:27,285 INFO L87 Difference]: Start difference. First operand 2919 states and 5024 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 00:57:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:57:43,543 INFO L93 Difference]: Finished difference Result 5126 states and 9291 transitions. [2023-11-29 00:57:43,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:57:43,543 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 00:57:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:57:43,550 INFO L225 Difference]: With dead ends: 5126 [2023-11-29 00:57:43,550 INFO L226 Difference]: Without dead ends: 5126 [2023-11-29 00:57:43,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2023-11-29 00:57:43,551 INFO L413 NwaCegarLoop]: 2484 mSDtfsCounter, 1459 mSDsluCounter, 12806 mSDsCounter, 0 mSdLazyCounter, 6589 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1961 SdHoareTripleChecker+Valid, 15290 SdHoareTripleChecker+Invalid, 6596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:57:43,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1961 Valid, 15290 Invalid, 6596 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 6589 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2023-11-29 00:57:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2023-11-29 00:57:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 2918. [2023-11-29 00:57:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 1573 states have (on average 1.916083916083916) internal successors, (3014), 2910 states have internal predecessors, (3014), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 00:57:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 5023 transitions. [2023-11-29 00:57:44,174 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 5023 transitions. Word has length 110 [2023-11-29 00:57:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:57:44,175 INFO L495 AbstractCegarLoop]: Abstraction has 2918 states and 5023 transitions. [2023-11-29 00:57:44,175 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 00:57:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 5023 transitions. [2023-11-29 00:57:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 00:57:44,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:57:44,176 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 00:57:44,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2023-11-29 00:57:44,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-11-29 00:57:44,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:57:44,577 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:57:44,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:57:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash 12751444, now seen corresponding path program 1 times [2023-11-29 00:57:44,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:57:44,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161997821] [2023-11-29 00:57:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:44,579 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 00:57:44,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:57:44,580 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:57:44,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-29 00:57:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:57:45,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 00:57:45,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:57:45,476 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 00:57:45,627 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:57:45,627 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 00:57:45,662 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 00:57:45,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:57:46,809 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:57:46,809 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 00:57:46,948 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:57:46,948 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 00:57:47,054 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:57:47,055 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 00:57:47,071 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 00:57:47,117 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 00:57:47,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:57:47,191 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6075) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 00:57:47,205 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6075 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:57:47,221 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6075 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6075)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:57:47,238 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6075 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6075)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:57:47,678 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6121 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6121))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6074)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6075)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:57:47,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:57:47,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161997821] [2023-11-29 00:57:47,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161997821] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:57:47,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1643344763] [2023-11-29 00:57:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:57:47,683 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:57:47,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:57:47,684 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:57:47,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-11-29 00:58:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:03,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 00:58:03,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:04,000 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 00:58:04,281 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:58:04,281 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 00:58:04,336 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 00:58:04,499 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 00:58:05,428 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:58:05,428 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 00:58:05,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:58:05,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 00:58:05,747 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:58:05,747 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 00:58:05,771 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 00:58:05,784 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 00:58:05,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:09,887 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6562 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:58:09,901 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6561))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6562)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:58:09,916 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6561))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6562)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:58:10,291 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6608))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6561)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6562)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:58:10,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1643344763] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:10,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:58:10,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 00:58:10,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083808998] [2023-11-29 00:58:10,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:58:10,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:58:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:58:10,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:58:10,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=308, Unknown=11, NotChecked=396, Total=812 [2023-11-29 00:58:10,296 INFO L87 Difference]: Start difference. First operand 2918 states and 5023 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 00:58:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:33,819 INFO L93 Difference]: Finished difference Result 5125 states and 9290 transitions. [2023-11-29 00:58:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:58:33,820 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 00:58:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:33,829 INFO L225 Difference]: With dead ends: 5125 [2023-11-29 00:58:33,829 INFO L226 Difference]: Without dead ends: 5125 [2023-11-29 00:58:33,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=106, Invalid=339, Unknown=11, NotChecked=414, Total=870 [2023-11-29 00:58:33,830 INFO L413 NwaCegarLoop]: 2458 mSDtfsCounter, 2937 mSDsluCounter, 10916 mSDsCounter, 0 mSdLazyCounter, 9131 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3439 SdHoareTripleChecker+Valid, 13374 SdHoareTripleChecker+Invalid, 9641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 9131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:33,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3439 Valid, 13374 Invalid, 9641 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [510 Valid, 9131 Invalid, 0 Unknown, 0 Unchecked, 23.1s Time] [2023-11-29 00:58:33,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5125 states. [2023-11-29 00:58:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5125 to 2917. [2023-11-29 00:58:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 1573 states have (on average 1.9154481881754608) internal successors, (3013), 2909 states have internal predecessors, (3013), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 00:58:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 5022 transitions. [2023-11-29 00:58:34,503 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 5022 transitions. Word has length 112 [2023-11-29 00:58:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:34,503 INFO L495 AbstractCegarLoop]: Abstraction has 2917 states and 5022 transitions. [2023-11-29 00:58:34,503 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 00:58:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 5022 transitions. [2023-11-29 00:58:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 00:58:34,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:34,504 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 00:58:34,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-11-29 00:58:34,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2023-11-29 00:58:34,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:58:34,905 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:58:34,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:34,906 INFO L85 PathProgramCache]: Analyzing trace with hash 12751445, now seen corresponding path program 1 times [2023-11-29 00:58:34,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:58:34,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436462261] [2023-11-29 00:58:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:34,906 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 00:58:34,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:58:34,907 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:58:34,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-11-29 00:58:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:36,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 00:58:36,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:36,116 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 00:58:36,268 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 00:58:36,281 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:58:36,281 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 00:58:36,309 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 00:58:36,321 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 00:58:36,428 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 22 treesize of output 10 [2023-11-29 00:58:36,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:58:37,143 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:58:37,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:58:37,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:58:37,269 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:58:37,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 62 treesize of output 57 [2023-11-29 00:58:37,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 30 treesize of output 13 [2023-11-29 00:58:37,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:58:37,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:58:37,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:58:37,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 00:58:37,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:58:37,430 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 00:58:37,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:37,604 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7095 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7095 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:58:37,648 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7095 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7095 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2023-11-29 00:58:37,824 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7095 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7093) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7095 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7094))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7093) .cse2 v_ArrVal_7095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 00:58:37,975 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7095 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7093) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7095 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7094))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7093) .cse3 v_ArrVal_7095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 00:58:40,192 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7187))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7188) .cse1 v_ArrVal_7093) (select (select (store .cse2 .cse1 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7095))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7187))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7094))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7188) .cse4 v_ArrVal_7093) .cse5 v_ArrVal_7095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 00:58:40,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:58:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436462261] [2023-11-29 00:58:40,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436462261] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [35728004] [2023-11-29 00:58:40,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:40,210 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:58:40,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:58:40,211 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:58:40,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-11-29 00:58:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:57,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 00:58:57,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:57,100 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 00:58:57,623 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 00:58:57,647 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:58:57,647 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 00:58:57,739 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 00:58:57,755 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 00:58:58,023 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 00:58:58,030 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 00:58:59,091 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:58:59,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:58:59,105 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 00:58:59,415 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:58:59,415 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 00:58:59,428 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 00:58:59,618 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:58:59,619 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 00:58:59,632 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 00:58:59,662 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 00:58:59,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:58:59,677 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 00:58:59,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:59,749 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7676) |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 00:58:59,789 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 00:58:59,847 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7674) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7673))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7674) .cse2 v_ArrVal_7676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 00:58:59,909 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7673))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7674) .cse1 v_ArrVal_7676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7674) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7676) |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 00:59:03,156 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7768))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7767) .cse1 v_ArrVal_7674) (select (select (store .cse2 .cse1 v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7676))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7768))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7673))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7767) .cse4 v_ArrVal_7674) .cse5 v_ArrVal_7676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 00:59:03,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [35728004] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:03,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:59:03,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 00:59:03,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249999303] [2023-11-29 00:59:03,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:59:03,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:59:03,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:59:03,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:59:03,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 00:59:03,176 INFO L87 Difference]: Start difference. First operand 2917 states and 5022 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 00:59:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:24,716 INFO L93 Difference]: Finished difference Result 5124 states and 9289 transitions. [2023-11-29 00:59:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:59:24,717 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 00:59:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:24,726 INFO L225 Difference]: With dead ends: 5124 [2023-11-29 00:59:24,726 INFO L226 Difference]: Without dead ends: 5124 [2023-11-29 00:59:24,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 00:59:24,727 INFO L413 NwaCegarLoop]: 2458 mSDtfsCounter, 1503 mSDsluCounter, 12694 mSDsCounter, 0 mSdLazyCounter, 6392 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 15152 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:24,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 15152 Invalid, 6399 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 6392 Invalid, 0 Unknown, 0 Unchecked, 20.9s Time] [2023-11-29 00:59:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2023-11-29 00:59:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 2916. [2023-11-29 00:59:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 1573 states have (on average 1.9148124602670058) internal successors, (3012), 2908 states have internal predecessors, (3012), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 00:59:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 5021 transitions. [2023-11-29 00:59:25,339 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 5021 transitions. Word has length 112 [2023-11-29 00:59:25,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:25,339 INFO L495 AbstractCegarLoop]: Abstraction has 2916 states and 5021 transitions. [2023-11-29 00:59:25,339 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 00:59:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 5021 transitions. [2023-11-29 00:59:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 00:59:25,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:25,340 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 00:59:25,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2023-11-29 00:59:25,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-11-29 00:59:25,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:59:25,741 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 00:59:25,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash -625567637, now seen corresponding path program 1 times [2023-11-29 00:59:25,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:59:25,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564981118] [2023-11-29 00:59:25,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:25,743 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 00:59:25,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:59:25,744 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:59:25,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-11-29 00:59:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:26,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 00:59:26,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:26,854 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 00:59:27,116 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:59:27,116 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 00:59:27,163 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 00:59:27,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:59:28,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:59:28,661 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 00:59:28,841 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:59:28,841 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 00:59:28,988 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:59:28,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 44 treesize of output 43 [2023-11-29 00:59:29,144 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:59:29,145 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 00:59:29,165 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 00:59:29,240 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 00:59:29,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:59:33,461 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8224 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:59:33,482 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8224 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8223 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (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$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8223))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8224)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:59:33,504 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8224 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8223 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8223))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8224)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:59:33,529 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8224 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8222))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8223)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8224)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:59:33,556 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8224 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8223)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8224)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:59:34,019 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8224 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8222 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8270))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8222)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8223)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8224)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:59:34,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:59:34,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564981118] [2023-11-29 00:59:34,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564981118] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:34,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1334901091] [2023-11-29 00:59:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:34,026 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:59:34,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:59:34,027 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:59:34,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2023-11-29 00:59:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:54,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 00:59:54,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:54,956 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 00:59:55,583 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:59:55,584 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 00:59:55,688 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 00:59:56,020 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 00:59:57,415 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:59:57,416 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 00:59:57,704 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:59:57,704 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 00:59:57,882 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:59:57,883 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 00:59:58,079 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:59:58,079 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 00:59:58,098 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 00:59:58,114 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 00:59:58,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:59:58,140 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8728) |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 00:59:58,160 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8728 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:59:58,182 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (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$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8727))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8728)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:59:58,204 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8727))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8728)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:59:58,229 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8726 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8726))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8727)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8728)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:59:59,163 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8774 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8774))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8726)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8727)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8728)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:59:59,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1334901091] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:59,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:59:59,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 00:59:59,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643615185] [2023-11-29 00:59:59,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:59:59,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 00:59:59,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:59:59,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:59:59,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=410, Unknown=16, NotChecked=636, Total=1190 [2023-11-29 00:59:59,172 INFO L87 Difference]: Start difference. First operand 2916 states and 5021 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 01:00:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:00:44,949 INFO L93 Difference]: Finished difference Result 5123 states and 9288 transitions. [2023-11-29 01:00:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:00:44,950 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 01:00:44,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:00:44,958 INFO L225 Difference]: With dead ends: 5123 [2023-11-29 01:00:44,958 INFO L226 Difference]: Without dead ends: 5123 [2023-11-29 01:00:44,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=138, Invalid=446, Unknown=16, NotChecked=660, Total=1260 [2023-11-29 01:00:44,959 INFO L413 NwaCegarLoop]: 2457 mSDtfsCounter, 2933 mSDsluCounter, 11010 mSDsCounter, 0 mSdLazyCounter, 9803 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3435 SdHoareTripleChecker+Valid, 13467 SdHoareTripleChecker+Invalid, 10313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 9803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:00:44,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3435 Valid, 13467 Invalid, 10313 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [510 Valid, 9803 Invalid, 0 Unknown, 0 Unchecked, 45.3s Time] [2023-11-29 01:00:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5123 states. [2023-11-29 01:00:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5123 to 2915. [2023-11-29 01:00:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 1573 states have (on average 1.9141767323585506) internal successors, (3011), 2907 states have internal predecessors, (3011), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2023-11-29 01:00:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 5020 transitions. [2023-11-29 01:00:45,556 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 5020 transitions. Word has length 114 [2023-11-29 01:00:45,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:00:45,556 INFO L495 AbstractCegarLoop]: Abstraction has 2915 states and 5020 transitions. [2023-11-29 01:00:45,556 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 01:00:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 5020 transitions. [2023-11-29 01:00:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:00:45,557 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:00:45,557 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 01:00:45,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2023-11-29 01:00:45,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2023-11-29 01:00:45,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:00:45,957 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:00:45,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:00:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash -625567636, now seen corresponding path program 1 times [2023-11-29 01:00:45,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:00:45,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085569086] [2023-11-29 01:00:45,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:00:45,959 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 01:00:45,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:00:45,960 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:00:45,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-11-29 01:00:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:47,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 01:00:47,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:00:47,151 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 01:00:47,371 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:00:47,371 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 01:00:47,381 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 01:00:47,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:00:47,445 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 01:00:47,599 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 22 treesize of output 10 [2023-11-29 01:00:47,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:00:48,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:00:48,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:00:48,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:00:48,947 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:00:48,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:00:48,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:00:49,105 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:00:49,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:00:49,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:00:49,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:00:49,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:00:49,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:00:49,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:00:49,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:00:49,367 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 01:00:49,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:00:49,596 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:00:49,636 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9278) |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 01:00:49,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9277) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9276))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9277) .cse2 v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:00:49,996 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9277) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9276))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9277) .cse3 v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:00:51,183 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9275))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9276))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9274) .cse0 v_ArrVal_9277) .cse1 v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9275))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9274) .cse6 v_ArrVal_9277) (select (select (store .cse7 .cse6 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9278))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 01:00:52,367 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9275))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9274) .cse2 v_ArrVal_9277) (select (select (store .cse3 .cse2 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9278))) |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_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (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$#1.base| .cse1 v_ArrVal_9275))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9276))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9274) .cse5 v_ArrVal_9277) .cse6 v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 01:00:58,319 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_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9370))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9275))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9276))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9371) .cse0 v_ArrVal_9274) .cse1 v_ArrVal_9277) .cse2 v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9370))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9275))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9371) .cse8 v_ArrVal_9274) .cse9 v_ArrVal_9277) (select (select (store .cse10 .cse9 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9278))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 01:00:58,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:00:58,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085569086] [2023-11-29 01:00:58,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085569086] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:00:58,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1923975361] [2023-11-29 01:00:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:00:58,361 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:00:58,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:00:58,362 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:00:58,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea5bee4-dffe-46a9-9900-676b1e5dd1c3/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-11-29 01:01:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:20,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 122 conjunts are in the unsatisfiable core [2023-11-29 01:01:20,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:01:20,735 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 01:01:23,523 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 01:01:23,676 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:01:23,676 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 01:01:24,089 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 01:01:24,164 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 01:01:25,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 18 treesize of output 10 [2023-11-29 01:01:25,407 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 01:01:30,273 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:01:30,273 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 01:01:30,323 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 01:01:31,512 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:01:31,512 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 01:01:31,562 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 01:01:32,362 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:01:32,363 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 01:01:32,414 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 01:01:33,212 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:01:33,213 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 01:01:33,265 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 01:01:33,369 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 01:01:33,420 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 01:01:33,445 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 01:01:33,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:01:33,665 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2023-11-29 01:01:33,791 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9876) |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 01:01:33,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9873) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9874))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9873) .cse2 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:01:34,059 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9874))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9873) .cse1 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9873) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9876) |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 01:01:35,795 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9872))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9874))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9871) .cse0 v_ArrVal_9873) .cse1 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9872))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9871) .cse6 v_ArrVal_9873) (select (select (store .cse7 .cse6 v_ArrVal_9874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9876))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 01:01:37,540 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9872))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9874))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9871) .cse1 v_ArrVal_9873) .cse2 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9872))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9871) .cse7 v_ArrVal_9873) (select (select (store .cse8 .cse7 v_ArrVal_9874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9876))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 01:01:45,877 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9968))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9872))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9967) .cse1 v_ArrVal_9871) .cse2 v_ArrVal_9873) (select (select (store .cse3 .cse2 v_ArrVal_9874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9876))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9968))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9872))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9874))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9967) .cse6 v_ArrVal_9871) .cse7 v_ArrVal_9873) .cse8 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 01:01:45,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1923975361] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:01:45,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:01:45,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:01:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41346676] [2023-11-29 01:01:45,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:01:45,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:01:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:01:45,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:01:45,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 01:01:45,925 INFO L87 Difference]: Start difference. First operand 2915 states and 5020 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)