./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-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_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/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_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/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_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/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 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:02:58,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:02:58,270 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:02:58,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:02:58,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:02:58,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:02:58,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:02:58,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:02:58,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:02:58,302 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:02:58,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:02:58,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:02:58,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:02:58,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:02:58,304 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:02:58,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:02:58,305 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:02:58,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:02:58,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:02:58,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:02:58,307 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:02:58,308 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:02:58,308 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:02:58,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:02:58,309 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:02:58,310 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:02:58,310 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:02:58,311 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:02:58,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:02:58,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:02:58,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:02:58,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:02:58,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:02:58,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:02:58,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:02:58,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:02:58,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:02:58,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:02:58,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:02:58,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:02:58,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:02:58,315 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_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/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_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/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 -> 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 [2023-11-29 04:02:58,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:02:58,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:02:58,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:02:58,529 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:02:58,530 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:02:58,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2023-11-29 04:03:01,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:03:01,553 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:03:01,554 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2023-11-29 04:03:01,571 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/data/6aaf1a89a/43f2b2e33a31413cad5ff9092a917aea/FLAGe4145425b [2023-11-29 04:03:01,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/data/6aaf1a89a/43f2b2e33a31413cad5ff9092a917aea [2023-11-29 04:03:01,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:03:01,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:03:01,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:03:01,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:03:01,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:03:01,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:03:01" (1/1) ... [2023-11-29 04:03:01,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cd3192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:01, skipping insertion in model container [2023-11-29 04:03:01,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:03:01" (1/1) ... [2023-11-29 04:03:01,661 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:03:02,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:03:02,130 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 04:03:02,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@23b28fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:02, skipping insertion in model container [2023-11-29 04:03:02,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:03:02,131 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 04:03:02,133 INFO L158 Benchmark]: Toolchain (without parser) took 545.84ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 104.8MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:03:02,134 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 111.1MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:03:02,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.11ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 104.8MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:03:02,136 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.12ms. Allocated memory is still 111.1MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 544.11ms. Allocated memory is still 159.4MB. Free memory was 125.2MB in the beginning and 104.8MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 736]: 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_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/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_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/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_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/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 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:03:03,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:03:03,915 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:03:03,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:03:03,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:03:03,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:03:03,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:03:03,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:03:03,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:03:03,954 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:03:03,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:03:03,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:03:03,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:03:03,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:03:03,956 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:03:03,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:03:03,957 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:03:03,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:03:03,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:03:03,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:03:03,959 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:03:03,962 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:03:03,962 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:03:03,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:03:03,964 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:03:03,964 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:03:03,964 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:03:03,965 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:03:03,965 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:03:03,966 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:03:03,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:03:03,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:03:03,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:03:03,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:03:03,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:03:03,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:03:03,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:03:03,968 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:03:03,968 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:03:03,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:03:03,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:03:03,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:03:03,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:03:03,969 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:03:03,969 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_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/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_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/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 -> 32a779d95d64b7b3ae1a801430dde2c7d15b3372c5d0cdd47679441a42687631 [2023-11-29 04:03:04,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:03:04,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:03:04,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:03:04,298 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:03:04,298 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:03:04,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2023-11-29 04:03:07,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:03:07,410 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:03:07,411 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-2.i [2023-11-29 04:03:07,429 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/data/4d64bdc42/2d96d00d2b0b40b9ab1306af772fe957/FLAG9e4ec8eb9 [2023-11-29 04:03:07,443 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/data/4d64bdc42/2d96d00d2b0b40b9ab1306af772fe957 [2023-11-29 04:03:07,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:03:07,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:03:07,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:03:07,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:03:07,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:03:07,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:03:07" (1/1) ... [2023-11-29 04:03:07,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b341880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:07, skipping insertion in model container [2023-11-29 04:03:07,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:03:07" (1/1) ... [2023-11-29 04:03:07,531 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:03:08,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:03:08,075 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 04:03:08,091 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:03:08,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:03:08,177 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:03:08,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:03:08,293 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:03:08,299 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:03:08,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08 WrapperNode [2023-11-29 04:03:08,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:03:08,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:03:08,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:03:08,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:03:08,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,402 INFO L138 Inliner]: procedures = 180, calls = 338, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1214 [2023-11-29 04:03:08,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:03:08,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:03:08,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:03:08,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:03:08,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,545 INFO L175 MemorySlicer]: Split 308 memory accesses to 4 slices as follows [2, 34, 267, 5]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 4, 58, 1]. [2023-11-29 04:03:08,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:03:08,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:03:08,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:03:08,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:03:08,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (1/1) ... [2023-11-29 04:03:08,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:03:08,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:03:08,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:03:08,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:03:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 04:03:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 04:03:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 04:03:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 04:03:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 04:03:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 04:03:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:03:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:03:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:03:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 04:03:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 04:03:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 04:03:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 04:03:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 04:03:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 04:03:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 04:03:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 04:03:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 04:03:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 04:03:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 04:03:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:03:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:03:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:03:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:03:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:03:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 04:03:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:03:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 04:03:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:03:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:03:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:03:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 04:03:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:03:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:03:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:03:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:03:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:03:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:03:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:03:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:03:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:03:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:03:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:03:08,916 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:03:08,917 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:03:08,941 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:03:08,977 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:03:08,998 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:03:09,019 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:03:13,852 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:03:14,005 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:03:14,005 INFO L309 CfgBuilder]: Removed 72 assume(true) statements. [2023-11-29 04:03:14,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:03:14 BoogieIcfgContainer [2023-11-29 04:03:14,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:03:14,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:03:14,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:03:14,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:03:14,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:03:07" (1/3) ... [2023-11-29 04:03:14,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd631b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:03:14, skipping insertion in model container [2023-11-29 04:03:14,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:03:08" (2/3) ... [2023-11-29 04:03:14,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd631b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:03:14, skipping insertion in model container [2023-11-29 04:03:14,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:03:14" (3/3) ... [2023-11-29 04:03:14,014 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-2.i [2023-11-29 04:03:14,029 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:03:14,029 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 638 error locations. [2023-11-29 04:03:14,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:03:14,090 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;@2444a5de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:03:14,090 INFO L358 AbstractCegarLoop]: Starting to check reachability of 638 error locations. [2023-11-29 04:03:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 1160 states, 511 states have (on average 2.5342465753424657) internal successors, (1295), 1153 states have internal predecessors, (1295), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 04:03:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:03:14,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:14,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:03:14,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:14,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash 64901, now seen corresponding path program 1 times [2023-11-29 04:03:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:14,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771022658] [2023-11-29 04:03:14,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:14,120 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 04:03:14,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:14,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:14,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:14,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:03:14,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:14,393 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 04:03:14,417 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 04:03:14,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:14,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:14,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771022658] [2023-11-29 04:03:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771022658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:14,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:03:14,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342895414] [2023-11-29 04:03:14,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:14,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:14,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:14,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:14,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:14,490 INFO L87 Difference]: Start difference. First operand has 1160 states, 511 states have (on average 2.5342465753424657) internal successors, (1295), 1153 states have internal predecessors, (1295), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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 04:03:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:16,697 INFO L93 Difference]: Finished difference Result 1321 states and 1406 transitions. [2023-11-29 04:03:16,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:16,699 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 04:03:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:16,716 INFO L225 Difference]: With dead ends: 1321 [2023-11-29 04:03:16,716 INFO L226 Difference]: Without dead ends: 1320 [2023-11-29 04:03:16,717 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 04:03:16,720 INFO L413 NwaCegarLoop]: 646 mSDtfsCounter, 1078 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:16,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 785 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 04:03:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2023-11-29 04:03:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1147. [2023-11-29 04:03:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 514 states have (on average 2.3463035019455254) internal successors, (1206), 1140 states have internal predecessors, (1206), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1224 transitions. [2023-11-29 04:03:16,800 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1224 transitions. Word has length 2 [2023-11-29 04:03:16,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:16,801 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1224 transitions. [2023-11-29 04:03:16,801 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 04:03:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1224 transitions. [2023-11-29 04:03:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:03:16,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:16,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:03:16,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:17,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:17,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:17,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:17,005 INFO L85 PathProgramCache]: Analyzing trace with hash 64902, now seen corresponding path program 1 times [2023-11-29 04:03:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:17,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148094404] [2023-11-29 04:03:17,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:17,006 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 04:03:17,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:17,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:17,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:17,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:03:17,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:17,125 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 04:03:17,140 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 04:03:17,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:17,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:17,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148094404] [2023-11-29 04:03:17,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148094404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:17,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:17,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:03:17,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820555456] [2023-11-29 04:03:17,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:17,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:17,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:17,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:17,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:17,145 INFO L87 Difference]: Start difference. First operand 1147 states and 1224 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 04:03:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:20,905 INFO L93 Difference]: Finished difference Result 1705 states and 1834 transitions. [2023-11-29 04:03:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:20,906 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 04:03:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:20,914 INFO L225 Difference]: With dead ends: 1705 [2023-11-29 04:03:20,914 INFO L226 Difference]: Without dead ends: 1705 [2023-11-29 04:03:20,915 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 04:03:20,916 INFO L413 NwaCegarLoop]: 864 mSDtfsCounter, 599 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:20,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1454 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 04:03:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2023-11-29 04:03:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1316. [2023-11-29 04:03:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 684 states have (on average 2.3201754385964914) internal successors, (1587), 1309 states have internal predecessors, (1587), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1605 transitions. [2023-11-29 04:03:20,955 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1605 transitions. Word has length 2 [2023-11-29 04:03:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:20,956 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1605 transitions. [2023-11-29 04:03:20,956 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 04:03:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1605 transitions. [2023-11-29 04:03:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 04:03:20,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:20,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 04:03:20,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:21,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:21,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:21,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash -191359793, now seen corresponding path program 1 times [2023-11-29 04:03:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:21,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094982352] [2023-11-29 04:03:21,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:21,160 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 04:03:21,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:21,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:21,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:21,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:03:21,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:21,304 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 04:03:21,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:03:21,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:03:21,374 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 04:03:21,393 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:03:21,394 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 04:03:21,414 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 04:03:21,414 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:21,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:21,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094982352] [2023-11-29 04:03:21,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094982352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:21,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:21,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:03:21,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948863788] [2023-11-29 04:03:21,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:21,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:03:21,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:21,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:03:21,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:03:21,417 INFO L87 Difference]: Start difference. First operand 1316 states and 1605 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 04:03:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:24,840 INFO L93 Difference]: Finished difference Result 1483 states and 1783 transitions. [2023-11-29 04:03:24,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:03:24,840 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 04:03:24,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:24,846 INFO L225 Difference]: With dead ends: 1483 [2023-11-29 04:03:24,846 INFO L226 Difference]: Without dead ends: 1483 [2023-11-29 04:03:24,847 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 04:03:24,847 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 2404 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:24,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2412 Valid, 403 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 04:03:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2023-11-29 04:03:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1136. [2023-11-29 04:03:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 514 states have (on average 2.32295719844358) internal successors, (1194), 1129 states have internal predecessors, (1194), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1212 transitions. [2023-11-29 04:03:24,878 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1212 transitions. Word has length 6 [2023-11-29 04:03:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:24,879 INFO L495 AbstractCegarLoop]: Abstraction has 1136 states and 1212 transitions. [2023-11-29 04:03:24,879 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 04:03:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1212 transitions. [2023-11-29 04:03:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:03:24,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:24,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:24,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:25,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:25,082 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:25,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:25,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1637186277, now seen corresponding path program 1 times [2023-11-29 04:03:25,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:25,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096070575] [2023-11-29 04:03:25,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:25,083 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 04:03:25,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:25,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:25,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:25,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:03:25,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:25,202 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 04:03:25,215 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 04:03:25,215 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:25,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096070575] [2023-11-29 04:03:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096070575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:25,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:25,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:03:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431252753] [2023-11-29 04:03:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:25,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:25,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:25,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:25,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:25,218 INFO L87 Difference]: Start difference. First operand 1136 states and 1212 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 04:03:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:27,444 INFO L93 Difference]: Finished difference Result 1430 states and 1536 transitions. [2023-11-29 04:03:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:27,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 04:03:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:27,452 INFO L225 Difference]: With dead ends: 1430 [2023-11-29 04:03:27,452 INFO L226 Difference]: Without dead ends: 1430 [2023-11-29 04:03:27,453 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 04:03:27,454 INFO L413 NwaCegarLoop]: 965 mSDtfsCounter, 895 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:27,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1265 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 04:03:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2023-11-29 04:03:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1087. [2023-11-29 04:03:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 514 states have (on average 2.227626459143969) internal successors, (1145), 1080 states have internal predecessors, (1145), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1163 transitions. [2023-11-29 04:03:27,483 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1163 transitions. Word has length 7 [2023-11-29 04:03:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:27,483 INFO L495 AbstractCegarLoop]: Abstraction has 1087 states and 1163 transitions. [2023-11-29 04:03:27,483 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 04:03:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1163 transitions. [2023-11-29 04:03:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:03:27,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:27,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:27,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 04:03:27,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:27,687 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:27,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:27,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1637186276, now seen corresponding path program 1 times [2023-11-29 04:03:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:27,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025947989] [2023-11-29 04:03:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:27,688 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 04:03:27,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:27,689 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:27,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:27,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:03:27,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:27,830 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 04:03:27,850 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 04:03:27,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:27,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:27,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025947989] [2023-11-29 04:03:27,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025947989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:27,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:27,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:03:27,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091207284] [2023-11-29 04:03:27,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:27,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:27,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:27,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:27,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:27,853 INFO L87 Difference]: Start difference. First operand 1087 states and 1163 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 04:03:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:31,235 INFO L93 Difference]: Finished difference Result 1500 states and 1609 transitions. [2023-11-29 04:03:31,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:31,236 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 04:03:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:31,243 INFO L225 Difference]: With dead ends: 1500 [2023-11-29 04:03:31,243 INFO L226 Difference]: Without dead ends: 1500 [2023-11-29 04:03:31,243 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 04:03:31,244 INFO L413 NwaCegarLoop]: 1138 mSDtfsCounter, 613 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:31,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1590 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 04:03:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2023-11-29 04:03:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1100. [2023-11-29 04:03:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 537 states have (on average 2.2197392923649906) internal successors, (1192), 1093 states have internal predecessors, (1192), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1210 transitions. [2023-11-29 04:03:31,273 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1210 transitions. Word has length 7 [2023-11-29 04:03:31,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:31,273 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1210 transitions. [2023-11-29 04:03:31,273 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 04:03:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1210 transitions. [2023-11-29 04:03:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 04:03:31,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:31,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:31,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 04:03:31,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:31,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:31,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:31,477 INFO L85 PathProgramCache]: Analyzing trace with hash -505370728, now seen corresponding path program 1 times [2023-11-29 04:03:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:31,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740468376] [2023-11-29 04:03:31,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:31,478 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 04:03:31,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:31,479 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:31,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:31,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:03:31,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:31,673 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 04:03:31,673 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:31,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:31,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740468376] [2023-11-29 04:03:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740468376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:31,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:03:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166090935] [2023-11-29 04:03:31,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:31,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:03:31,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:31,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:03:31,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:03:31,676 INFO L87 Difference]: Start difference. First operand 1100 states and 1210 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 04:03:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:33,920 INFO L93 Difference]: Finished difference Result 1689 states and 1843 transitions. [2023-11-29 04:03:33,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:03:33,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 04:03:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:33,929 INFO L225 Difference]: With dead ends: 1689 [2023-11-29 04:03:33,929 INFO L226 Difference]: Without dead ends: 1689 [2023-11-29 04:03:33,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 04:03:33,930 INFO L413 NwaCegarLoop]: 1119 mSDtfsCounter, 689 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:33,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 2996 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 04:03:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2023-11-29 04:03:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1304. [2023-11-29 04:03:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 741 states have (on average 2.174089068825911) internal successors, (1611), 1297 states have internal predecessors, (1611), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1629 transitions. [2023-11-29 04:03:33,970 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1629 transitions. Word has length 10 [2023-11-29 04:03:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:33,970 INFO L495 AbstractCegarLoop]: Abstraction has 1304 states and 1629 transitions. [2023-11-29 04:03:33,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 04:03:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1629 transitions. [2023-11-29 04:03:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 04:03:33,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:33,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:33,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:34,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:34,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:34,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:34,173 INFO L85 PathProgramCache]: Analyzing trace with hash -915022471, now seen corresponding path program 1 times [2023-11-29 04:03:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555591841] [2023-11-29 04:03:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:34,173 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 04:03:34,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:34,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:34,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:34,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:03:34,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:34,301 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 04:03:34,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:34,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555591841] [2023-11-29 04:03:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555591841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:34,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:34,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:03:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860262735] [2023-11-29 04:03:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:34,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:34,303 INFO L87 Difference]: Start difference. First operand 1304 states and 1629 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 04:03:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:35,195 INFO L93 Difference]: Finished difference Result 1250 states and 1549 transitions. [2023-11-29 04:03:35,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:35,197 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 04:03:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:35,202 INFO L225 Difference]: With dead ends: 1250 [2023-11-29 04:03:35,202 INFO L226 Difference]: Without dead ends: 1250 [2023-11-29 04:03:35,202 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 04:03:35,202 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 70 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:35,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1897 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:03:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-11-29 04:03:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2023-11-29 04:03:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 711 states have (on average 2.1533052039381153) internal successors, (1531), 1243 states have internal predecessors, (1531), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1549 transitions. [2023-11-29 04:03:35,221 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1549 transitions. Word has length 12 [2023-11-29 04:03:35,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:35,221 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1549 transitions. [2023-11-29 04:03:35,221 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 04:03:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1549 transitions. [2023-11-29 04:03:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 04:03:35,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:35,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:35,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 04:03:35,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:35,423 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:35,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1131726450, now seen corresponding path program 1 times [2023-11-29 04:03:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:35,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575026128] [2023-11-29 04:03:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:35,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:35,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:35,425 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:35,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:35,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:03:35,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:35,570 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 04:03:35,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:35,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:35,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575026128] [2023-11-29 04:03:35,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575026128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:35,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:35,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:03:35,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431293163] [2023-11-29 04:03:35,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:35,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:03:35,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:35,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:03:35,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:03:35,572 INFO L87 Difference]: Start difference. First operand 1250 states and 1549 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:36,631 INFO L93 Difference]: Finished difference Result 1236 states and 1507 transitions. [2023-11-29 04:03:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:03:36,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 04:03:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:36,637 INFO L225 Difference]: With dead ends: 1236 [2023-11-29 04:03:36,638 INFO L226 Difference]: Without dead ends: 1236 [2023-11-29 04:03:36,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 04:03:36,638 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 58 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:36,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2802 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:03:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2023-11-29 04:03:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1234. [2023-11-29 04:03:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 709 states have (on average 2.0973201692524683) internal successors, (1487), 1227 states have internal predecessors, (1487), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1505 transitions. [2023-11-29 04:03:36,656 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1505 transitions. Word has length 14 [2023-11-29 04:03:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:36,656 INFO L495 AbstractCegarLoop]: Abstraction has 1234 states and 1505 transitions. [2023-11-29 04:03:36,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:03:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1505 transitions. [2023-11-29 04:03:36,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 04:03:36,657 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:36,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:36,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:36,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:36,858 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr636ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:36,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:36,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1857646529, now seen corresponding path program 1 times [2023-11-29 04:03:36,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:36,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353503791] [2023-11-29 04:03:36,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:36,859 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 04:03:36,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:36,860 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:36,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:36,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:03:36,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:37,004 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:03:37,005 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:03:37,005 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:03:37,008 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 04:03:37,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:03:37,050 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 04:03:37,064 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 04:03:37,065 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:37,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:37,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353503791] [2023-11-29 04:03:37,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353503791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:37,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:37,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:03:37,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658486208] [2023-11-29 04:03:37,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:37,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:03:37,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:37,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:03:37,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:03:37,066 INFO L87 Difference]: Start difference. First operand 1234 states and 1505 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 04:03:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:38,916 INFO L93 Difference]: Finished difference Result 2201 states and 2578 transitions. [2023-11-29 04:03:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:03:38,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 04:03:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:38,926 INFO L225 Difference]: With dead ends: 2201 [2023-11-29 04:03:38,926 INFO L226 Difference]: Without dead ends: 2201 [2023-11-29 04:03:38,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 04:03:38,927 INFO L413 NwaCegarLoop]: 1136 mSDtfsCounter, 1007 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 3214 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:38,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 3214 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 04:03:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2023-11-29 04:03:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 1233. [2023-11-29 04:03:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 708 states have (on average 2.097457627118644) internal successors, (1485), 1226 states have internal predecessors, (1485), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1503 transitions. [2023-11-29 04:03:38,956 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1503 transitions. Word has length 15 [2023-11-29 04:03:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:38,956 INFO L495 AbstractCegarLoop]: Abstraction has 1233 states and 1503 transitions. [2023-11-29 04:03:38,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 04:03:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1503 transitions. [2023-11-29 04:03:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 04:03:38,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:38,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:03:38,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:39,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:39,161 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:39,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:39,161 INFO L85 PathProgramCache]: Analyzing trace with hash -72847630, now seen corresponding path program 1 times [2023-11-29 04:03:39,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:39,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599657689] [2023-11-29 04:03:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:39,162 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 04:03:39,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:39,163 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:39,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:39,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:03:39,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:39,321 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 04:03:39,321 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:39,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:39,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599657689] [2023-11-29 04:03:39,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599657689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:39,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:39,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:03:39,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946826915] [2023-11-29 04:03:39,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:39,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:03:39,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:39,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:03:39,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:03:39,323 INFO L87 Difference]: Start difference. First operand 1233 states and 1503 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 04:03:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:40,055 INFO L93 Difference]: Finished difference Result 1179 states and 1423 transitions. [2023-11-29 04:03:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:03:40,056 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 04:03:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:40,061 INFO L225 Difference]: With dead ends: 1179 [2023-11-29 04:03:40,061 INFO L226 Difference]: Without dead ends: 1179 [2023-11-29 04:03:40,061 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 04:03:40,062 INFO L413 NwaCegarLoop]: 915 mSDtfsCounter, 70 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:40,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1781 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:03:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2023-11-29 04:03:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2023-11-29 04:03:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 678 states have (on average 2.0722713864306783) internal successors, (1405), 1172 states have internal predecessors, (1405), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1423 transitions. [2023-11-29 04:03:40,086 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1423 transitions. Word has length 15 [2023-11-29 04:03:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:40,086 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1423 transitions. [2023-11-29 04:03:40,087 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 04:03:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1423 transitions. [2023-11-29 04:03:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 04:03:40,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:40,087 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 04:03:40,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 04:03:40,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:40,290 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:40,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1287098164, now seen corresponding path program 1 times [2023-11-29 04:03:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:40,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976942108] [2023-11-29 04:03:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:40,291 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 04:03:40,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:40,292 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:40,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:40,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:03:40,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:40,470 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 04:03:40,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:40,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:40,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976942108] [2023-11-29 04:03:40,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976942108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:40,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:40,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:03:40,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001917195] [2023-11-29 04:03:40,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:40,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:03:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:40,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:03:40,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:03:40,472 INFO L87 Difference]: Start difference. First operand 1179 states and 1423 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 04:03:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:41,355 INFO L93 Difference]: Finished difference Result 1165 states and 1381 transitions. [2023-11-29 04:03:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:03:41,357 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 04:03:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:41,361 INFO L225 Difference]: With dead ends: 1165 [2023-11-29 04:03:41,361 INFO L226 Difference]: Without dead ends: 1165 [2023-11-29 04:03:41,362 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 04:03:41,362 INFO L413 NwaCegarLoop]: 884 mSDtfsCounter, 58 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:41,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2628 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:03:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2023-11-29 04:03:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1163. [2023-11-29 04:03:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 676 states have (on average 2.0133136094674557) internal successors, (1361), 1156 states have internal predecessors, (1361), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1379 transitions. [2023-11-29 04:03:41,382 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1379 transitions. Word has length 17 [2023-11-29 04:03:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:41,382 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1379 transitions. [2023-11-29 04:03:41,383 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 04:03:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1379 transitions. [2023-11-29 04:03:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:03:41,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:41,384 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 04:03:41,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 04:03:41,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:41,588 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:41,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash 25746362, now seen corresponding path program 1 times [2023-11-29 04:03:41,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:41,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963456459] [2023-11-29 04:03:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:41,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 04:03:41,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:41,589 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:41,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:41,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:03:41,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:41,782 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 04:03:41,863 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 04:03:41,863 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:41,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:41,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963456459] [2023-11-29 04:03:41,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963456459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:41,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:41,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:03:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342637257] [2023-11-29 04:03:41,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:41,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:03:41,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:41,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:03:41,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:03:41,865 INFO L87 Difference]: Start difference. First operand 1163 states and 1379 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 04:03:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:44,388 INFO L93 Difference]: Finished difference Result 1511 states and 1841 transitions. [2023-11-29 04:03:44,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:03:44,389 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 04:03:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:44,396 INFO L225 Difference]: With dead ends: 1511 [2023-11-29 04:03:44,396 INFO L226 Difference]: Without dead ends: 1511 [2023-11-29 04:03:44,396 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 04:03:44,396 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 760 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:44,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1267 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 04:03:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2023-11-29 04:03:44,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1159. [2023-11-29 04:03:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 676 states have (on average 2.0014792899408285) internal successors, (1353), 1152 states have internal predecessors, (1353), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1371 transitions. [2023-11-29 04:03:44,410 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1371 transitions. Word has length 31 [2023-11-29 04:03:44,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:44,410 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 1371 transitions. [2023-11-29 04:03:44,411 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 04:03:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1371 transitions. [2023-11-29 04:03:44,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:03:44,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:44,411 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 04:03:44,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:44,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:44,612 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:44,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:44,613 INFO L85 PathProgramCache]: Analyzing trace with hash 25746363, now seen corresponding path program 1 times [2023-11-29 04:03:44,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:44,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312432255] [2023-11-29 04:03:44,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:44,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:44,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:44,614 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:44,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:44,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:03:44,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:44,776 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 04:03:44,938 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 04:03:44,939 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:44,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312432255] [2023-11-29 04:03:44,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312432255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:44,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:44,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:03:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448278107] [2023-11-29 04:03:44,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:44,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:03:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:44,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:03:44,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:03:44,941 INFO L87 Difference]: Start difference. First operand 1159 states and 1371 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 04:03:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:48,571 INFO L93 Difference]: Finished difference Result 1613 states and 1922 transitions. [2023-11-29 04:03:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:03:48,571 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 04:03:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:48,578 INFO L225 Difference]: With dead ends: 1613 [2023-11-29 04:03:48,579 INFO L226 Difference]: Without dead ends: 1613 [2023-11-29 04:03:48,579 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 04:03:48,579 INFO L413 NwaCegarLoop]: 1076 mSDtfsCounter, 480 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:48,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 2159 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 04:03:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2023-11-29 04:03:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1155. [2023-11-29 04:03:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 676 states have (on average 1.9896449704142012) internal successors, (1345), 1148 states have internal predecessors, (1345), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1363 transitions. [2023-11-29 04:03:48,600 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1363 transitions. Word has length 31 [2023-11-29 04:03:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:48,600 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1363 transitions. [2023-11-29 04:03:48,600 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 04:03:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1363 transitions. [2023-11-29 04:03:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 04:03:48,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:48,602 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 04:03:48,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:48,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:48,802 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:48,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1619588407, now seen corresponding path program 1 times [2023-11-29 04:03:48,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:48,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061109306] [2023-11-29 04:03:48,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:48,803 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 04:03:48,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:48,804 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:48,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:49,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:03:49,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:49,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 04:03:49,038 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:49,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:49,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061109306] [2023-11-29 04:03:49,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061109306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:49,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:49,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:03:49,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654558401] [2023-11-29 04:03:49,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:49,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:03:49,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:03:49,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:03:49,041 INFO L87 Difference]: Start difference. First operand 1155 states and 1363 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 04:03:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:49,923 INFO L93 Difference]: Finished difference Result 1143 states and 1343 transitions. [2023-11-29 04:03:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:03:49,925 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 04:03:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:49,929 INFO L225 Difference]: With dead ends: 1143 [2023-11-29 04:03:49,929 INFO L226 Difference]: Without dead ends: 1143 [2023-11-29 04:03:49,930 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 04:03:49,930 INFO L413 NwaCegarLoop]: 878 mSDtfsCounter, 23 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:49,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2614 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:03:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2023-11-29 04:03:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2023-11-29 04:03:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 664 states have (on average 1.9954819277108433) internal successors, (1325), 1136 states have internal predecessors, (1325), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1343 transitions. [2023-11-29 04:03:49,945 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1343 transitions. Word has length 50 [2023-11-29 04:03:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:49,945 INFO L495 AbstractCegarLoop]: Abstraction has 1143 states and 1343 transitions. [2023-11-29 04:03:49,945 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 04:03:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1343 transitions. [2023-11-29 04:03:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 04:03:49,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:49,947 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 04:03:49,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:50,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:50,147 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:50,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash -597599178, now seen corresponding path program 1 times [2023-11-29 04:03:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:50,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424258315] [2023-11-29 04:03:50,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:50,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:03:50,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:50,150 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:50,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:50,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:03:50,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:50,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:03:50,472 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 04:03:50,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:03:50,929 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 04:03:50,943 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:03:50,943 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 04:03:50,953 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 04:03:50,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:50,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424258315] [2023-11-29 04:03:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424258315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:50,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:50,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:03:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100860022] [2023-11-29 04:03:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:50,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:03:50,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:50,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:03:50,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:03:50,957 INFO L87 Difference]: Start difference. First operand 1143 states and 1343 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 04:03:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:53,835 INFO L93 Difference]: Finished difference Result 1457 states and 1775 transitions. [2023-11-29 04:03:53,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:03:53,837 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 04:03:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:53,843 INFO L225 Difference]: With dead ends: 1457 [2023-11-29 04:03:53,843 INFO L226 Difference]: Without dead ends: 1457 [2023-11-29 04:03:53,843 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 04:03:53,844 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 968 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:53,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 704 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 04:03:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2023-11-29 04:03:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1082. [2023-11-29 04:03:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 641 states have (on average 1.9188767550702028) internal successors, (1230), 1075 states have internal predecessors, (1230), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1248 transitions. [2023-11-29 04:03:53,858 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1248 transitions. Word has length 54 [2023-11-29 04:03:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:53,859 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1248 transitions. [2023-11-29 04:03:53,859 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 04:03:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1248 transitions. [2023-11-29 04:03:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 04:03:53,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:53,860 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 04:03:53,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:54,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:54,060 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:54,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash 940938836, now seen corresponding path program 1 times [2023-11-29 04:03:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:54,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297185106] [2023-11-29 04:03:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:54,061 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 04:03:54,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:54,062 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:54,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:54,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:03:54,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:54,314 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 04:03:54,328 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 04:03:54,348 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 04:03:54,357 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 04:03:54,357 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:54,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:54,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297185106] [2023-11-29 04:03:54,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297185106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:54,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:54,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:03:54,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63270021] [2023-11-29 04:03:54,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:54,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:03:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:54,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:03:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:03:54,359 INFO L87 Difference]: Start difference. First operand 1082 states and 1248 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 04:03:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:03:57,246 INFO L93 Difference]: Finished difference Result 1081 states and 1247 transitions. [2023-11-29 04:03:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:03:57,247 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 04:03:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:03:57,251 INFO L225 Difference]: With dead ends: 1081 [2023-11-29 04:03:57,251 INFO L226 Difference]: Without dead ends: 1081 [2023-11-29 04:03:57,251 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 04:03:57,252 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 3 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:03:57,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2221 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 04:03:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2023-11-29 04:03:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2023-11-29 04:03:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 641 states have (on average 1.9173166926677068) internal successors, (1229), 1074 states have internal predecessors, (1229), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:03:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1247 transitions. [2023-11-29 04:03:57,263 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1247 transitions. Word has length 58 [2023-11-29 04:03:57,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:03:57,263 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1247 transitions. [2023-11-29 04:03:57,263 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 04:03:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1247 transitions. [2023-11-29 04:03:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 04:03:57,264 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:03:57,264 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 04:03:57,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:57,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:57,465 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:03:57,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:03:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash 940938837, now seen corresponding path program 1 times [2023-11-29 04:03:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:03:57,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450669873] [2023-11-29 04:03:57,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:03:57,466 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 04:03:57,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:03:57,467 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:57,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:03:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:03:57,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:03:57,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:03:57,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:03:57,737 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 04:03:57,744 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 04:03:57,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 21 treesize of output 9 [2023-11-29 04:03:57,795 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 04:03:57,796 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:03:57,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:03:57,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450669873] [2023-11-29 04:03:57,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450669873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:03:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:03:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:03:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322238834] [2023-11-29 04:03:57,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:03:57,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:03:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:03:57,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:03:57,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:03:57,798 INFO L87 Difference]: Start difference. First operand 1081 states and 1247 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 04:04:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:04:01,317 INFO L93 Difference]: Finished difference Result 1080 states and 1246 transitions. [2023-11-29 04:04:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:04:01,318 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 04:04:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:04:01,324 INFO L225 Difference]: With dead ends: 1080 [2023-11-29 04:04:01,324 INFO L226 Difference]: Without dead ends: 1080 [2023-11-29 04:04:01,324 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 04:04:01,325 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 1 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:04:01,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2272 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-29 04:04:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2023-11-29 04:04:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1080. [2023-11-29 04:04:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 640 states have (on average 1.91875) internal successors, (1228), 1073 states have internal predecessors, (1228), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 04:04:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1246 transitions. [2023-11-29 04:04:01,336 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1246 transitions. Word has length 58 [2023-11-29 04:04:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:04:01,336 INFO L495 AbstractCegarLoop]: Abstraction has 1080 states and 1246 transitions. [2023-11-29 04:04:01,336 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 04:04:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1246 transitions. [2023-11-29 04:04:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 04:04:01,337 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:04:01,337 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 04:04:01,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:01,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:01,538 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:04:01,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1281895928, now seen corresponding path program 1 times [2023-11-29 04:04:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:01,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389919573] [2023-11-29 04:04:01,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:01,539 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 04:04:01,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:01,540 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:01,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:01,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:04:01,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:01,812 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 04:04:01,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:04:01,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:01,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389919573] [2023-11-29 04:04:01,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389919573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:04:01,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:04:01,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:04:01,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890610583] [2023-11-29 04:04:01,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:04:01,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:04:01,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:01,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:04:01,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:04:01,815 INFO L87 Difference]: Start difference. First operand 1080 states and 1246 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 04:04:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:04:02,773 INFO L93 Difference]: Finished difference Result 1082 states and 1249 transitions. [2023-11-29 04:04:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:04:02,775 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 04:04:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:04:02,781 INFO L225 Difference]: With dead ends: 1082 [2023-11-29 04:04:02,781 INFO L226 Difference]: Without dead ends: 1082 [2023-11-29 04:04:02,782 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 04:04:02,782 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 1 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:04:02,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2553 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:04:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2023-11-29 04:04:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1082. [2023-11-29 04:04:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 641 states have (on average 1.9188767550702028) internal successors, (1230), 1075 states have internal predecessors, (1230), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:04:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1249 transitions. [2023-11-29 04:04:02,801 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1249 transitions. Word has length 64 [2023-11-29 04:04:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:04:02,801 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1249 transitions. [2023-11-29 04:04:02,801 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 04:04:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1249 transitions. [2023-11-29 04:04:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 04:04:02,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:04:02,802 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 04:04:02,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 04:04:03,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:03,003 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:04:03,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:03,003 INFO L85 PathProgramCache]: Analyzing trace with hash -781788007, now seen corresponding path program 1 times [2023-11-29 04:04:03,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:03,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650660797] [2023-11-29 04:04:03,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:04:03,004 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 04:04:03,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:03,005 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:03,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:04:03,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:04:03,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:03,314 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 04:04:03,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:04:03,365 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 04:04:03,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:03,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650660797] [2023-11-29 04:04:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650660797] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:04:03,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:04:03,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 04:04:03,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980483419] [2023-11-29 04:04:03,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:04:03,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:04:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:03,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:04:03,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:04:03,368 INFO L87 Difference]: Start difference. First operand 1082 states and 1249 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 04:04:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:04:04,595 INFO L93 Difference]: Finished difference Result 1091 states and 1263 transitions. [2023-11-29 04:04:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:04:04,596 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 04:04:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:04:04,600 INFO L225 Difference]: With dead ends: 1091 [2023-11-29 04:04:04,600 INFO L226 Difference]: Without dead ends: 1091 [2023-11-29 04:04:04,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:04:04,601 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 6 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:04:04,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3399 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:04:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2023-11-29 04:04:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1090. [2023-11-29 04:04:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 648 states have (on average 1.9182098765432098) internal successors, (1243), 1082 states have internal predecessors, (1243), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:04:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1262 transitions. [2023-11-29 04:04:04,617 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1262 transitions. Word has length 65 [2023-11-29 04:04:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:04:04,617 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1262 transitions. [2023-11-29 04:04:04,617 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 04:04:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1262 transitions. [2023-11-29 04:04:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 04:04:04,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:04:04,618 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 04:04:04,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 04:04:04,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:04,818 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:04:04,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:04,819 INFO L85 PathProgramCache]: Analyzing trace with hash -303083976, now seen corresponding path program 2 times [2023-11-29 04:04:04,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:04,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058688213] [2023-11-29 04:04:04,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:04:04,819 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 04:04:04,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:04,820 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:04,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:05,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:04:05,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:04:05,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:04:05,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:05,290 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 04:04:05,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:04:05,425 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 04:04:05,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:05,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058688213] [2023-11-29 04:04:05,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058688213] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:04:05,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:04:05,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 04:04:05,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804722453] [2023-11-29 04:04:05,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:04:05,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:04:05,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:05,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:04:05,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:04:05,428 INFO L87 Difference]: Start difference. First operand 1090 states and 1262 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 04:04:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:04:07,809 INFO L93 Difference]: Finished difference Result 1105 states and 1284 transitions. [2023-11-29 04:04:07,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 04:04:07,810 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 04:04:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:04:07,813 INFO L225 Difference]: With dead ends: 1105 [2023-11-29 04:04:07,813 INFO L226 Difference]: Without dead ends: 1103 [2023-11-29 04:04:07,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 04:04:07,814 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 12 mSDsluCounter, 5099 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5950 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:04:07,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5950 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 04:04:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2023-11-29 04:04:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1099. [2023-11-29 04:04:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 657 states have (on average 1.9101978691019788) internal successors, (1255), 1091 states have internal predecessors, (1255), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:04:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1274 transitions. [2023-11-29 04:04:07,833 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1274 transitions. Word has length 68 [2023-11-29 04:04:07,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:04:07,833 INFO L495 AbstractCegarLoop]: Abstraction has 1099 states and 1274 transitions. [2023-11-29 04:04:07,833 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 04:04:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1274 transitions. [2023-11-29 04:04:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 04:04:07,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:04:07,834 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 04:04:07,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:08,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:08,035 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:04:08,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1773929112, now seen corresponding path program 3 times [2023-11-29 04:04:08,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:08,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820666537] [2023-11-29 04:04:08,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:04:08,036 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 04:04:08,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:08,037 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:08,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:08,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 04:04:08,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:04:08,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:04:08,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:08,878 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 04:04:08,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:04:09,414 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 04:04:09,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:09,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820666537] [2023-11-29 04:04:09,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820666537] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:04:09,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:04:09,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 04:04:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214819381] [2023-11-29 04:04:09,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:04:09,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 04:04:09,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:09,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 04:04:09,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:04:09,416 INFO L87 Difference]: Start difference. First operand 1099 states and 1274 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 04:04:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:04:14,697 INFO L93 Difference]: Finished difference Result 1129 states and 1324 transitions. [2023-11-29 04:04:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 04:04:14,698 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 04:04:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:04:14,702 INFO L225 Difference]: With dead ends: 1129 [2023-11-29 04:04:14,702 INFO L226 Difference]: Without dead ends: 1126 [2023-11-29 04:04:14,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 04:04:14,704 INFO L413 NwaCegarLoop]: 850 mSDtfsCounter, 24 mSDsluCounter, 9337 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10187 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:04:14,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10187 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 04:04:14,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2023-11-29 04:04:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1117. [2023-11-29 04:04:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 675 states have (on average 1.8933333333333333) internal successors, (1278), 1109 states have internal predecessors, (1278), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:04:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1297 transitions. [2023-11-29 04:04:14,718 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1297 transitions. Word has length 74 [2023-11-29 04:04:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:04:14,719 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1297 transitions. [2023-11-29 04:04:14,719 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 04:04:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1297 transitions. [2023-11-29 04:04:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 04:04:14,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:04:14,720 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 04:04:14,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:14,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:14,920 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:04:14,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1342772056, now seen corresponding path program 4 times [2023-11-29 04:04:14,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:14,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936552185] [2023-11-29 04:04:14,921 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:04:14,921 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 04:04:14,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:14,922 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:14,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:15,269 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:04:15,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:04:15,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:04:15,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:15,634 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 04:04:15,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:04:17,123 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 04:04:17,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936552185] [2023-11-29 04:04:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936552185] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:04:17,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:04:17,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 04:04:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643906448] [2023-11-29 04:04:17,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:04:17,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 04:04:17,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:04:17,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 04:04:17,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 04:04:17,127 INFO L87 Difference]: Start difference. First operand 1117 states and 1297 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 04:04:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:04:31,622 INFO L93 Difference]: Finished difference Result 1174 states and 1386 transitions. [2023-11-29 04:04:31,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 04:04:31,623 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 04:04:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:04:31,627 INFO L225 Difference]: With dead ends: 1174 [2023-11-29 04:04:31,627 INFO L226 Difference]: Without dead ends: 1172 [2023-11-29 04:04:31,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 04:04:31,631 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 47 mSDsluCounter, 23794 mSDsCounter, 0 mSdLazyCounter, 5452 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 24645 SdHoareTripleChecker+Invalid, 5496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 5452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:04:31,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 24645 Invalid, 5496 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 5452 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2023-11-29 04:04:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2023-11-29 04:04:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1151. [2023-11-29 04:04:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 709 states have (on average 1.8674188998589563) internal successors, (1324), 1143 states have internal predecessors, (1324), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:04:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1343 transitions. [2023-11-29 04:04:31,652 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1343 transitions. Word has length 86 [2023-11-29 04:04:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:04:31,653 INFO L495 AbstractCegarLoop]: Abstraction has 1151 states and 1343 transitions. [2023-11-29 04:04:31,653 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 04:04:31,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1343 transitions. [2023-11-29 04:04:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:04:31,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:04:31,655 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 04:04:31,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:31,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:31,863 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:04:31,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:04:31,863 INFO L85 PathProgramCache]: Analyzing trace with hash 207204536, now seen corresponding path program 5 times [2023-11-29 04:04:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:04:31,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268554339] [2023-11-29 04:04:31,864 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:04:31,864 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 04:04:31,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:04:31,865 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:04:31,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 04:04:33,107 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 04:04:33,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:04:33,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 04:04:33,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:04:33,147 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 04:04:33,251 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:04:33,251 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 04:04:33,282 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 04:04:33,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:04:34,245 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:04:34,246 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 04:04:34,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 04:04:34,327 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 04:04:34,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:04:38,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:04:38,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268554339] [2023-11-29 04:04:38,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268554339] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:04:38,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1640997504] [2023-11-29 04:04:38,793 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:04:38,793 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:04:38,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:04:38,794 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:04:38,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 04:05:37,291 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 04:05:37,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:05:37,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 04:05:37,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:05:37,496 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 04:05:37,825 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:05:37,826 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 04:05:37,902 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 04:05:38,048 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 04:05:39,037 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:05:39,037 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 04:05:39,133 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 04:05:39,144 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 04:05:39,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:05:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1640997504] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:05:43,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:05:43,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 04:05:43,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688497647] [2023-11-29 04:05:43,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:05:43,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 04:05:43,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:05:43,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 04:05:43,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=185, Unknown=2, NotChecked=0, Total=240 [2023-11-29 04:05:43,577 INFO L87 Difference]: Start difference. First operand 1151 states and 1343 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 04:05:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:05:53,020 INFO L93 Difference]: Finished difference Result 1504 states and 1812 transitions. [2023-11-29 04:05:53,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:05:53,021 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 04:05:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:05:53,025 INFO L225 Difference]: With dead ends: 1504 [2023-11-29 04:05:53,025 INFO L226 Difference]: Without dead ends: 1502 [2023-11-29 04:05:53,025 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 04:05:53,026 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 652 mSDsluCounter, 3186 mSDsCounter, 0 mSdLazyCounter, 4059 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 3751 SdHoareTripleChecker+Invalid, 4066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:05:53,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 3751 Invalid, 4066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4059 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2023-11-29 04:05:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2023-11-29 04:05:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1150. [2023-11-29 04:05:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 709 states have (on average 1.8603667136812412) internal successors, (1319), 1142 states have internal predecessors, (1319), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:05:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1338 transitions. [2023-11-29 04:05:53,053 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1338 transitions. Word has length 108 [2023-11-29 04:05:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:05:53,054 INFO L495 AbstractCegarLoop]: Abstraction has 1150 states and 1338 transitions. [2023-11-29 04:05:53,054 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 04:05:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1338 transitions. [2023-11-29 04:05:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:05:53,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:05:53,056 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 04:05:53,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-11-29 04:05:53,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 04:05:53,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:05:53,462 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:05:53,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:05:53,462 INFO L85 PathProgramCache]: Analyzing trace with hash 207204537, now seen corresponding path program 1 times [2023-11-29 04:05:53,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:05:53,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881290175] [2023-11-29 04:05:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:53,463 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 04:05:53,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:05:53,464 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:05:53,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-29 04:05:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:05:54,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-29 04:05:54,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:05:54,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:05:54,275 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 04:05:54,289 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:05:54,289 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 04:05:54,318 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 04:05:54,324 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 04:05:54,437 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 04:05:54,442 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 04:05:55,201 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:05:55,202 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 04:05:55,215 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 04:05:55,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 31 treesize of output 13 [2023-11-29 04:05:55,257 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 04:05:55,282 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 04:05:55,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:05:56,635 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:05:56,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:05:56,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881290175] [2023-11-29 04:05:56,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881290175] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:05:56,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1029983358] [2023-11-29 04:05:56,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:05:56,643 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:05:56,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:05:56,644 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:05:56,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 04:07:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:44,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 04:07:44,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:07:44,417 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 04:07:44,740 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:07:44,741 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 04:07:44,751 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 04:07:44,818 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 04:07:44,832 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 04:07:44,981 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 04:07:44,986 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 04:07:45,713 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:07:45,713 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 04:07:45,723 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 04:07:45,802 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 04:07:45,807 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 04:07:45,814 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 04:07:45,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:07:47,117 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3593) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3593) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 04:07:47,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1029983358] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:07:47,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:07:47,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 04:07:47,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722611001] [2023-11-29 04:07:47,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:07:47,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 04:07:47,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:07:47,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 04:07:47,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 04:07:47,125 INFO L87 Difference]: Start difference. First operand 1150 states and 1338 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 04:07:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:07:57,488 INFO L93 Difference]: Finished difference Result 1501 states and 1807 transitions. [2023-11-29 04:07:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:07:57,489 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 04:07:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:07:57,491 INFO L225 Difference]: With dead ends: 1501 [2023-11-29 04:07:57,491 INFO L226 Difference]: Without dead ends: 1501 [2023-11-29 04:07:57,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-11-29 04:07:57,492 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 1246 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 4646 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 2713 SdHoareTripleChecker+Invalid, 4663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:07:57,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 2713 Invalid, 4663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4646 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2023-11-29 04:07:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2023-11-29 04:07:57,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1149. [2023-11-29 04:07:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 709 states have (on average 1.8589562764456982) internal successors, (1318), 1141 states have internal predecessors, (1318), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:07:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1337 transitions. [2023-11-29 04:07:57,506 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1337 transitions. Word has length 108 [2023-11-29 04:07:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:07:57,507 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1337 transitions. [2023-11-29 04:07:57,507 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 04:07:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1337 transitions. [2023-11-29 04:07:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 04:07:57,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:07:57,508 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 04:07:57,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2023-11-29 04:07:57,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-11-29 04:07:57,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:07:57,909 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:07:57,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:07:57,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1556735612, now seen corresponding path program 1 times [2023-11-29 04:07:57,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:07:57,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876406234] [2023-11-29 04:07:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:07:57,910 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 04:07:57,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:07:57,911 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:07:57,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-29 04:07:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:07:58,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 04:07:58,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:07:58,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 04:07:58,814 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:07:58,814 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 04:07:58,851 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 04:07:58,947 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 04:07:59,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:07:59,816 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 04:07:59,954 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:07:59,955 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 04:07:59,968 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 04:08:00,007 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 04:08:00,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:08:04,133 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4016 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:08:04,511 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4016 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4016)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:08:04,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:08:04,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876406234] [2023-11-29 04:08:04,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876406234] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:08:04,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1249310521] [2023-11-29 04:08:04,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:04,514 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:08:04,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:08:04,515 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:08:04,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 04:08:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:07,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 04:08:07,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:08:07,804 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 04:08:08,136 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:08:08,136 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 04:08:08,208 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 04:08:08,386 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 04:08:09,229 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:08:09,229 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 04:08:09,396 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:08:09,397 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 04:08:09,413 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 04:08:09,423 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 04:08:09,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:08:13,904 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4016 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4532))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4016)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:08:13,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1249310521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:08:13,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:08:13,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 04:08:13,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564027166] [2023-11-29 04:08:13,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:08:13,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:08:13,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:08:13,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:08:13,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=241, Unknown=5, NotChecked=102, Total=420 [2023-11-29 04:08:13,908 INFO L87 Difference]: Start difference. First operand 1149 states and 1337 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 04:08:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:22,106 INFO L93 Difference]: Finished difference Result 1500 states and 1806 transitions. [2023-11-29 04:08:22,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:08:22,107 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 04:08:22,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:22,109 INFO L225 Difference]: With dead ends: 1500 [2023-11-29 04:08:22,109 INFO L226 Difference]: Without dead ends: 1500 [2023-11-29 04:08:22,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=81, Invalid=268, Unknown=5, NotChecked=108, Total=462 [2023-11-29 04:08:22,110 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 647 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 3837 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 3843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:22,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 3513 Invalid, 3843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3837 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-11-29 04:08:22,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2023-11-29 04:08:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1148. [2023-11-29 04:08:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 709 states have (on average 1.8575458392101551) internal successors, (1317), 1140 states have internal predecessors, (1317), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:08:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1336 transitions. [2023-11-29 04:08:22,125 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1336 transitions. Word has length 110 [2023-11-29 04:08:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:22,125 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1336 transitions. [2023-11-29 04:08:22,125 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 04:08:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1336 transitions. [2023-11-29 04:08:22,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 04:08:22,126 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:22,126 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 04:08:22,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 04:08:22,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-29 04:08:22,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:08:22,536 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:08:22,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1556735613, now seen corresponding path program 1 times [2023-11-29 04:08:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:08:22,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249397050] [2023-11-29 04:08:22,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:22,537 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 04:08:22,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:08:22,538 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:08:22,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-29 04:08:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:23,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 04:08:23,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:08:23,335 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 04:08:23,456 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:08:23,456 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 04:08:23,463 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 04:08:23,492 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 04:08:23,501 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 04:08:23,597 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 04:08:23,602 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 04:08:24,266 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:08:24,267 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 04:08:24,280 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 04:08:24,407 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:08:24,408 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 04:08:24,419 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 04:08:24,438 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 04:08:24,443 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 04:08:24,472 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 04:08:24,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:08:24,624 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:08:24,659 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_5001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_5001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_5002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:08:25,970 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5094) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5002 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5093))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5094) .cse2 v_ArrVal_5001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5002) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 04:08:25,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:08:25,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249397050] [2023-11-29 04:08:25,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249397050] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:08:25,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [110783181] [2023-11-29 04:08:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:25,979 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:08:25,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:08:25,980 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:08:25,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 04:10:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:23,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 04:10:23,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:23,469 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 04:10:23,767 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:10:23,767 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 04:10:23,777 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 04:10:23,847 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 04:10:23,855 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 04:10:24,012 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 04:10:24,017 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 04:10:24,693 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:10:24,693 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 04:10:24,702 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 04:10:24,876 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:10:24,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:10:24,884 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 04:10:24,899 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 04:10:24,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:10:24,910 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 04:10:24,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:10:24,962 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5563) |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 04:10:24,997 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_5563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_5563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_5564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:10:26,417 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5655))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5656) .cse0 v_ArrVal_5563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5656) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5563) |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 04:10:26,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [110783181] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:10:26,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:10:26,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 04:10:26,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52592123] [2023-11-29 04:10:26,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:10:26,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:10:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:26,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:10:26,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 04:10:26,428 INFO L87 Difference]: Start difference. First operand 1148 states and 1336 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 04:10:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:10:40,060 INFO L93 Difference]: Finished difference Result 1499 states and 1805 transitions. [2023-11-29 04:10:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:10:40,060 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 04:10:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:10:40,063 INFO L225 Difference]: With dead ends: 1499 [2023-11-29 04:10:40,063 INFO L226 Difference]: Without dead ends: 1499 [2023-11-29 04:10:40,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 04:10:40,063 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 652 mSDsluCounter, 3032 mSDsCounter, 0 mSdLazyCounter, 6222 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 3595 SdHoareTripleChecker+Invalid, 6232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:10:40,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 3595 Invalid, 6232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 6222 Invalid, 0 Unknown, 0 Unchecked, 13.3s Time] [2023-11-29 04:10:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2023-11-29 04:10:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1147. [2023-11-29 04:10:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 709 states have (on average 1.8561354019746121) internal successors, (1316), 1139 states have internal predecessors, (1316), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:10:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1335 transitions. [2023-11-29 04:10:40,077 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1335 transitions. Word has length 110 [2023-11-29 04:10:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:10:40,078 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1335 transitions. [2023-11-29 04:10:40,078 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 04:10:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1335 transitions. [2023-11-29 04:10:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:10:40,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:10:40,079 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 04:10:40,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-11-29 04:10:40,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-11-29 04:10:40,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:10:40,482 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:10:40,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1375971675, now seen corresponding path program 1 times [2023-11-29 04:10:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688039201] [2023-11-29 04:10:40,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:40,483 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 04:10:40,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:40,484 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:10:40,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-29 04:10:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:41,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 04:10:41,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:41,366 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 04:10:41,516 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:10:41,517 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 04:10:41,554 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 04:10:41,641 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 04:10:42,598 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:10:42,598 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 04:10:42,720 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:10:42,721 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 04:10:42,801 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:10:42,801 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 04:10:42,814 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 04:10:42,853 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 04:10:42,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:10:46,998 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6095 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:10:47,011 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6094 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6094))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6095)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 04:10:47,024 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6094 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6094))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6095)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:10:47,390 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6094 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6141))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6094)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6095)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:10:47,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688039201] [2023-11-29 04:10:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688039201] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:10:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [799895040] [2023-11-29 04:10:47,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:47,394 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:10:47,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:10:47,395 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:10:47,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 04:11:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:12,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 04:11:12,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:11:12,883 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 04:11:13,225 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:11:13,225 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 04:11:13,291 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 04:11:13,487 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 04:11:14,349 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:11:14,350 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 04:11:14,527 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:11:14,528 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 04:11:14,637 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:11:14,638 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 04:11:14,653 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 04:11:14,664 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 04:11:14,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:11:18,841 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6580))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6095)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:11:19,223 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6627))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6580)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6095)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:11:19,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [799895040] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:11:19,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:11:19,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 04:11:19,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098021585] [2023-11-29 04:11:19,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:11:19,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 04:11:19,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:11:19,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 04:11:19,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=338, Unknown=11, NotChecked=258, Total=702 [2023-11-29 04:11:19,228 INFO L87 Difference]: Start difference. First operand 1147 states and 1335 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 04:11:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:11:30,493 INFO L93 Difference]: Finished difference Result 1498 states and 1804 transitions. [2023-11-29 04:11:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:11:30,494 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 04:11:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:11:30,496 INFO L225 Difference]: With dead ends: 1498 [2023-11-29 04:11:30,496 INFO L226 Difference]: Without dead ends: 1498 [2023-11-29 04:11:30,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=104, Invalid=371, Unknown=11, NotChecked=270, Total=756 [2023-11-29 04:11:30,497 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 1213 mSDsluCounter, 3901 mSDsCounter, 0 mSdLazyCounter, 5001 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 4464 SdHoareTripleChecker+Invalid, 5013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:11:30,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 4464 Invalid, 5013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 5001 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2023-11-29 04:11:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2023-11-29 04:11:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1146. [2023-11-29 04:11:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 709 states have (on average 1.8547249647390691) internal successors, (1315), 1138 states have internal predecessors, (1315), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:11:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1334 transitions. [2023-11-29 04:11:30,509 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1334 transitions. Word has length 112 [2023-11-29 04:11:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:11:30,510 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1334 transitions. [2023-11-29 04:11:30,510 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 04:11:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1334 transitions. [2023-11-29 04:11:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:11:30,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:11:30,511 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 04:11:30,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 04:11:30,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 04:11:30,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:11:30,911 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:11:30,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:11:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1375971676, now seen corresponding path program 1 times [2023-11-29 04:11:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:11:30,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044116624] [2023-11-29 04:11:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:11:30,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:11:30,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:11:30,914 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:11:30,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-11-29 04:11:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:11:31,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 04:11:31,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:11:31,932 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 04:11:32,056 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 04:11:32,071 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:11:32,071 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 04:11:32,102 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 04:11:32,115 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 04:11:32,226 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 04:11:32,231 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 04:11:32,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:11:32,953 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 04:11:32,963 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 04:11:33,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:11:33,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:11:33,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:11:33,202 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:11:33,203 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 04:11:33,215 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 04:11:33,240 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 04:11:33,247 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 04:11:33,274 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 04:11:33,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:11:33,427 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7113) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7113 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7113) |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 04:11:33,464 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7113 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7113) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7113) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:11:33,595 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7113 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7111) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7112) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7113) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7113 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7112))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7111) .cse2 v_ArrVal_7113) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 04:11:44,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:11:44,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044116624] [2023-11-29 04:11:44,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044116624] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:11:44,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [38949369] [2023-11-29 04:11:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:11:44,952 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:11:44,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:11:44,953 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:11:44,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 04:12:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:15,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 04:12:15,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:15,652 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 04:12:17,331 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:12:17,331 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 04:12:17,363 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 04:12:17,676 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 04:12:17,722 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 04:12:18,439 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 04:12:18,455 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 04:12:21,339 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:12:21,340 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 04:12:21,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:12:22,173 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:12:22,173 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 04:12:22,205 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 04:12:22,689 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:12:22,689 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 04:12:22,734 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 04:12:22,797 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 04:12:22,829 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 04:12:22,832 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 04:12:22,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:22,984 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7694 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7694 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:12:23,063 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7694 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_7694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_7693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7694 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_7694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 04:12:23,164 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7694 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7691))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7692) .cse0 v_ArrVal_7694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7694 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7692) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 04:12:23,337 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7694 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7692) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7694 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7691))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7692) .cse3 v_ArrVal_7694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:12:37,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [38949369] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:37,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:12:37,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 04:12:37,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491512262] [2023-11-29 04:12:37,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:37,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 04:12:37,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:12:37,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 04:12:37,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=367, Unknown=31, NotChecked=322, Total=812 [2023-11-29 04:12:37,106 INFO L87 Difference]: Start difference. First operand 1146 states and 1334 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 04:13:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:13:35,966 INFO L93 Difference]: Finished difference Result 1497 states and 1803 transitions. [2023-11-29 04:13:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:13:35,967 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 04:13:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:13:35,969 INFO L225 Difference]: With dead ends: 1497 [2023-11-29 04:13:35,970 INFO L226 Difference]: Without dead ends: 1497 [2023-11-29 04:13:35,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=152, Invalid=600, Unknown=32, NotChecked=406, Total=1190 [2023-11-29 04:13:35,971 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 1232 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 5290 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:13:35,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 3022 Invalid, 5306 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 5290 Invalid, 0 Unknown, 0 Unchecked, 57.1s Time] [2023-11-29 04:13:35,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2023-11-29 04:13:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1145. [2023-11-29 04:13:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 709 states have (on average 1.853314527503526) internal successors, (1314), 1137 states have internal predecessors, (1314), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:13:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1333 transitions. [2023-11-29 04:13:35,983 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1333 transitions. Word has length 112 [2023-11-29 04:13:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:13:35,983 INFO L495 AbstractCegarLoop]: Abstraction has 1145 states and 1333 transitions. [2023-11-29 04:13:35,983 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 04:13:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1333 transitions. [2023-11-29 04:13:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 04:13:35,984 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:13:35,984 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 04:13:35,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-11-29 04:13:36,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 04:13:36,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:13:36,385 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:13:36,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:13:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash -539485484, now seen corresponding path program 1 times [2023-11-29 04:13:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:13:36,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921701889] [2023-11-29 04:13:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:13:36,386 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 04:13:36,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:13:36,387 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:13:36,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-11-29 04:13:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:13:37,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 04:13:37,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:13:37,383 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 04:13:38,552 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:13:38,553 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 04:13:38,792 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 04:13:39,302 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 04:13:43,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:13:43,933 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 04:13:44,515 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:13:44,515 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 04:13:44,983 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:13:44,983 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 04:13:45,458 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:13:45,459 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 04:13:45,541 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 04:13:45,792 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 04:13:45,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:13:46,196 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8241) |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 04:13:46,265 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:13:46,336 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8240))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8241)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:13:46,408 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8240))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8241)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:13:46,482 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8239 (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 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8239))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8240)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8241)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:13:46,558 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8239 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8239))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8240)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8241)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:13:47,916 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8239 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8287))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8239)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8240)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8241)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:13:47,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:13:47,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921701889] [2023-11-29 04:13:47,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921701889] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:13:47,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1636810971] [2023-11-29 04:13:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:13:47,930 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:13:47,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:13:47,931 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:13:47,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 04:14:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:14:36,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 04:14:36,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:14:36,600 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 04:14:38,928 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:14:38,928 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 04:14:39,322 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 04:14:40,302 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 04:14:44,699 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:14:44,699 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 04:14:45,775 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:14:45,776 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 04:14:46,415 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:14:46,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 04:14:47,131 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:14:47,131 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 04:14:47,197 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 04:14:47,258 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 04:14:47,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:14:51,786 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8743 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:14:51,859 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8742))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8743)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:14:51,932 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8742))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8743)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:14:52,527 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8741))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8742)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8743)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 04:14:53,958 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8789 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8789))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8741)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8742)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8743)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:14:53,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1636810971] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:14:53,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:14:53,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 04:14:53,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690496697] [2023-11-29 04:14:53,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:14:53,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:14:53,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:14:53,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:14:53,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=416, Unknown=18, NotChecked=636, Total=1190 [2023-11-29 04:14:53,974 INFO L87 Difference]: Start difference. First operand 1145 states and 1333 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 04:15:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:15:58,293 INFO L93 Difference]: Finished difference Result 1496 states and 1802 transitions. [2023-11-29 04:15:58,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:15:58,294 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 04:15:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:15:58,297 INFO L225 Difference]: With dead ends: 1496 [2023-11-29 04:15:58,298 INFO L226 Difference]: Without dead ends: 1496 [2023-11-29 04:15:58,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=129, Invalid=453, Unknown=18, NotChecked=660, Total=1260 [2023-11-29 04:15:58,299 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 635 mSDsluCounter, 4475 mSDsCounter, 0 mSdLazyCounter, 5749 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 5037 SdHoareTripleChecker+Invalid, 5756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:15:58,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 5037 Invalid, 5756 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 5749 Invalid, 0 Unknown, 0 Unchecked, 63.9s Time] [2023-11-29 04:15:58,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2023-11-29 04:15:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1144. [2023-11-29 04:15:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 709 states have (on average 1.851904090267983) internal successors, (1313), 1136 states have internal predecessors, (1313), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 04:15:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1332 transitions. [2023-11-29 04:15:58,317 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1332 transitions. Word has length 114 [2023-11-29 04:15:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:15:58,318 INFO L495 AbstractCegarLoop]: Abstraction has 1144 states and 1332 transitions. [2023-11-29 04:15:58,318 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 04:15:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1332 transitions. [2023-11-29 04:15:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 04:15:58,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:15:58,319 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 04:15:58,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2023-11-29 04:15:58,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 04:15:58,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:15:58,720 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 04:15:58,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:15:58,720 INFO L85 PathProgramCache]: Analyzing trace with hash -539485483, now seen corresponding path program 1 times [2023-11-29 04:15:58,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:15:58,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275280373] [2023-11-29 04:15:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:15:58,721 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 04:15:58,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:15:58,723 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:15:58,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-11-29 04:15:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:15:59,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 04:15:59,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:15:59,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:16:00,864 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 04:16:00,963 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:16:00,964 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 04:16:01,137 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 04:16:01,180 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 04:16:01,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 22 treesize of output 10 [2023-11-29 04:16:01,738 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 04:16:05,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:16:05,812 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 04:16:05,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:16:06,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:16:06,445 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 04:16:06,487 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 04:16:06,957 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:16:06,957 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 04:16:07,000 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 04:16:07,493 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:16:07,494 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 04:16:07,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:16:07,603 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 04:16:07,650 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 04:16:07,854 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 04:16:07,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:16:08,491 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9292 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9292) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:16:08,611 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9292 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_9292) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:16:08,735 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9290))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9291) .cse0 v_ArrVal_9293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9292) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9291) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2023-11-29 04:16:08,850 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9291) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_9290))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9291) .cse3 v_ArrVal_9293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9292) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:16:09,043 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9288))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9289) .cse1 v_ArrVal_9291) (select (select (store .cse2 .cse1 v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9293))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9288))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9290))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9289) .cse4 v_ArrVal_9291) .cse5 v_ArrVal_9293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9292) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 04:16:09,258 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_9288))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9289) .cse2 v_ArrVal_9291) (select (select (store .cse3 .cse2 v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9293))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_9288))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9290))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9289) .cse5 v_ArrVal_9291) .cse6 v_ArrVal_9293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9292) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 04:16:17,091 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9385 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9384 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9385))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9288))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9384) .cse1 v_ArrVal_9289) .cse2 v_ArrVal_9291) (select (select (store .cse3 .cse2 v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9293))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9385 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9384 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9293 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9292 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9385))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9288))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9290))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9384) .cse6 v_ArrVal_9289) .cse7 v_ArrVal_9291) .cse8 v_ArrVal_9293) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9292) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 04:16:17,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:16:17,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275280373] [2023-11-29 04:16:17,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275280373] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:16:17,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [235049383] [2023-11-29 04:16:17,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:16:17,134 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:16:17,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:16:17,135 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:16:17,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ed97e3c-8591-4e69-ad25-e6ffdae6b644/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 04:16:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:16:56,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 04:16:56,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:16:56,559 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 04:16:59,286 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 04:16:59,425 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:16:59,425 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 04:16:59,916 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 04:16:59,941 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 04:17:01,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:17:01,218 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 04:17:06,258 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:17:06,259 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 04:17:06,319 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 04:17:07,545 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:17:07,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 04:17:07,599 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 04:17:08,432 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:17:08,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:17:08,488 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 04:17:09,306 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:17:09,306 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 04:17:09,356 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 04:17:09,460 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 04:17:09,513 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 04:17:09,539 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 04:17:09,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:17:09,791 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 04:17:09,910 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:17:10,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9887))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9886) .cse0 v_ArrVal_9889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9886) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 04:17:10,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_9887))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_9886) .cse1 v_ArrVal_9889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_9886) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9889) |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 04:17:10,383 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9884))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9885) .cse1 v_ArrVal_9886) (select (select (store .cse2 .cse1 v_ArrVal_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9889))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9884))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9887))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9885) .cse4 v_ArrVal_9886) .cse5 v_ArrVal_9889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 04:17:10,549 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_9884))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9885) .cse2 v_ArrVal_9886) (select (select (store .cse3 .cse2 v_ArrVal_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9889))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_9884))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9887))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_9885) .cse5 v_ArrVal_9886) .cse6 v_ArrVal_9889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 04:17:18,693 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9981))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9884))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9980) .cse1 v_ArrVal_9885) .cse2 v_ArrVal_9886) (select (select (store .cse3 .cse2 v_ArrVal_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9889))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9981))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9884))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9887))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9980) .cse6 v_ArrVal_9885) .cse7 v_ArrVal_9886) .cse8 v_ArrVal_9889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 04:17:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [235049383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:17:18,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:17:18,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 04:17:18,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296576018] [2023-11-29 04:17:18,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:17:18,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:17:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:17:18,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:17:18,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 04:17:18,734 INFO L87 Difference]: Start difference. First operand 1144 states and 1332 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)