./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:04:44,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:04:44,536 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:04:44,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:04:44,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:04:44,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:04:44,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:04:44,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:04:44,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:04:44,567 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:04:44,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:04:44,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:04:44,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:04:44,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:04:44,570 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:04:44,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:04:44,571 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:04:44,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:04:44,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:04:44,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:04:44,573 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:04:44,573 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:04:44,574 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:04:44,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:04:44,574 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:04:44,575 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:04:44,575 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:04:44,576 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:04:44,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:04:44,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:04:44,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:04:44,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:04:44,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:04:44,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:04:44,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:04:44,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:04:44,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:04:44,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:04:44,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:04:44,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:04:44,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:04:44,581 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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2023-11-29 05:04:44,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:04:44,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:04:44,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:04:44,820 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:04:44,821 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:04:44,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i [2023-11-29 05:04:47,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:04:47,859 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:04:47,860 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i [2023-11-29 05:04:47,877 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/data/4590ac89d/cba8b7257c7441a780581c78d481b89b/FLAG1c763959a [2023-11-29 05:04:47,891 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/data/4590ac89d/cba8b7257c7441a780581c78d481b89b [2023-11-29 05:04:47,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:04:47,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:04:47,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:04:47,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:04:47,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:04:47,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:04:47" (1/1) ... [2023-11-29 05:04:47,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aec52f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:47, skipping insertion in model container [2023-11-29 05:04:47,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:04:47" (1/1) ... [2023-11-29 05:04:47,968 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:04:48,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:04:48,416 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 05:04:48,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@38a80d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:48, skipping insertion in model container [2023-11-29 05:04:48,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:04:48,417 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 05:04:48,419 INFO L158 Benchmark]: Toolchain (without parser) took 523.28ms. Allocated memory is still 140.5MB. Free memory was 108.1MB in the beginning and 87.9MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 05:04:48,419 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:04:48,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.04ms. Allocated memory is still 140.5MB. Free memory was 107.6MB in the beginning and 87.9MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 05:04:48,421 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.17ms. Allocated memory is still 102.8MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.04ms. Allocated memory is still 140.5MB. Free memory was 107.6MB in the beginning and 87.9MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 817]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:04:50,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:04:50,212 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 05:04:50,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:04:50,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:04:50,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:04:50,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:04:50,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:04:50,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:04:50,249 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:04:50,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:04:50,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:04:50,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:04:50,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:04:50,252 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:04:50,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:04:50,253 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:04:50,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:04:50,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:04:50,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:04:50,255 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:04:50,255 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:04:50,256 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:04:50,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:04:50,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:04:50,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:04:50,257 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:04:50,257 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:04:50,258 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:04:50,258 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:04:50,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:04:50,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:04:50,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:04:50,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:04:50,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:04:50,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:04:50,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:04:50,260 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:04:50,261 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:04:50,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:04:50,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:04:50,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:04:50,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:04:50,262 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:04:50,262 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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2023-11-29 05:04:50,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:04:50,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:04:50,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:04:50,598 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:04:50,599 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:04:50,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i [2023-11-29 05:04:53,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:04:53,652 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:04:53,653 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-2.i [2023-11-29 05:04:53,686 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/data/5e4b866c7/da0dc572e76a404fa5da47d31d975e68/FLAG36b13ed6a [2023-11-29 05:04:53,701 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/data/5e4b866c7/da0dc572e76a404fa5da47d31d975e68 [2023-11-29 05:04:53,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:04:53,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:04:53,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:04:53,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:04:53,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:04:53,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:04:53" (1/1) ... [2023-11-29 05:04:53,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc630c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:53, skipping insertion in model container [2023-11-29 05:04:53,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:04:53" (1/1) ... [2023-11-29 05:04:53,785 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:04:54,328 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:04:54,342 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 05:04:54,354 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:04:54,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:04:54,454 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:04:54,519 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:04:54,559 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:04:54,567 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:04:54,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54 WrapperNode [2023-11-29 05:04:54,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:04:54,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:04:54,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:04:54,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:04:54,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,664 INFO L138 Inliner]: procedures = 210, calls = 281, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1040 [2023-11-29 05:04:54,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:04:54,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:04:54,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:04:54,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:04:54,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,771 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 5, 34, 218]. 84 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 1, 4, 50]. [2023-11-29 05:04:54,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:04:54,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:04:54,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:04:54,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:04:54,845 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (1/1) ... [2023-11-29 05:04:54,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:04:54,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:04:54,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:04:54,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:04:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 05:04:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 05:04:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 05:04:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 05:04:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 05:04:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 05:04:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 05:04:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 05:04:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 05:04:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 05:04:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 05:04:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 05:04:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 05:04:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 05:04:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 05:04:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 05:04:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:04:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 05:04:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:04:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:04:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:04:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 05:04:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:04:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:04:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:04:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 05:04:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:04:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:04:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:04:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:04:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 05:04:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:04:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:04:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:04:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:04:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:04:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 05:04:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:04:54,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:04:55,122 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:04:55,124 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:04:55,128 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:04:55,181 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:04:55,203 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:04:55,223 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:04:59,696 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:04:59,839 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:04:59,840 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-11-29 05:04:59,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:04:59 BoogieIcfgContainer [2023-11-29 05:04:59,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:04:59,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:04:59,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:04:59,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:04:59,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:04:53" (1/3) ... [2023-11-29 05:04:59,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd7ac97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:04:59, skipping insertion in model container [2023-11-29 05:04:59,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:04:54" (2/3) ... [2023-11-29 05:04:59,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd7ac97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:04:59, skipping insertion in model container [2023-11-29 05:04:59,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:04:59" (3/3) ... [2023-11-29 05:04:59,850 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-2.i [2023-11-29 05:04:59,864 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:04:59,865 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 531 error locations. [2023-11-29 05:04:59,921 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:04:59,927 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;@7fe05f1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:04:59,927 INFO L358 AbstractCegarLoop]: Starting to check reachability of 531 error locations. [2023-11-29 05:04:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 963 states, 430 states have (on average 2.5209302325581397) internal successors, (1084), 958 states have internal predecessors, (1084), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:04:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 05:04:59,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:04:59,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 05:04:59,940 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr530ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:04:59,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:04:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1689533, now seen corresponding path program 1 times [2023-11-29 05:04:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:04:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402883815] [2023-11-29 05:04:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:04:59,957 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 05:04:59,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:04:59,958 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:04:59,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:00,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:05:00,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:00,250 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_53| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_53| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_53|)))) is different from true [2023-11-29 05:05:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:05:00,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:00,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:00,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402883815] [2023-11-29 05:05:00,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402883815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:00,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:00,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:05:00,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496613755] [2023-11-29 05:05:00,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:00,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:00,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:00,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 05:05:00,318 INFO L87 Difference]: Start difference. First operand has 963 states, 430 states have (on average 2.5209302325581397) internal successors, (1084), 958 states have internal predecessors, (1084), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:03,017 INFO L93 Difference]: Finished difference Result 1319 states and 1408 transitions. [2023-11-29 05:05:03,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:03,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 05:05:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:03,036 INFO L225 Difference]: With dead ends: 1319 [2023-11-29 05:05:03,036 INFO L226 Difference]: Without dead ends: 1317 [2023-11-29 05:05:03,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 05:05:03,040 INFO L413 NwaCegarLoop]: 752 mSDtfsCounter, 396 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1409 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:03,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1222 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 804 Invalid, 0 Unknown, 1409 Unchecked, 2.6s Time] [2023-11-29 05:05:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2023-11-29 05:05:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 952. [2023-11-29 05:05:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 425 states have (on average 2.36) internal successors, (1003), 947 states have internal predecessors, (1003), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1009 transitions. [2023-11-29 05:05:03,117 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1009 transitions. Word has length 3 [2023-11-29 05:05:03,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:03,117 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1009 transitions. [2023-11-29 05:05:03,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1009 transitions. [2023-11-29 05:05:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 05:05:03,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:03,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 05:05:03,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:03,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:03,319 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:03,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1687933, now seen corresponding path program 1 times [2023-11-29 05:05:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:03,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928461963] [2023-11-29 05:05:03,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:03,321 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 05:05:03,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:03,322 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:03,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:03,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:05:03,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:03,439 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 05:05:03,455 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 05:05:03,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:03,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:03,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928461963] [2023-11-29 05:05:03,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928461963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:03,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:03,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:05:03,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104302101] [2023-11-29 05:05:03,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:03,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:05:03,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:03,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:05:03,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:05:03,460 INFO L87 Difference]: Start difference. First operand 952 states and 1009 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:05,370 INFO L93 Difference]: Finished difference Result 1115 states and 1181 transitions. [2023-11-29 05:05:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:05:05,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 05:05:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:05,377 INFO L225 Difference]: With dead ends: 1115 [2023-11-29 05:05:05,377 INFO L226 Difference]: Without dead ends: 1115 [2023-11-29 05:05:05,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:05:05,379 INFO L413 NwaCegarLoop]: 521 mSDtfsCounter, 893 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:05,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 642 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 05:05:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-11-29 05:05:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 950. [2023-11-29 05:05:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 433 states have (on average 2.3140877598152425) internal successors, (1002), 945 states have internal predecessors, (1002), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1008 transitions. [2023-11-29 05:05:05,407 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1008 transitions. Word has length 3 [2023-11-29 05:05:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:05,408 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1008 transitions. [2023-11-29 05:05:05,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1008 transitions. [2023-11-29 05:05:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 05:05:05,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:05,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 05:05:05,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:05,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:05,609 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:05,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:05,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1687934, now seen corresponding path program 1 times [2023-11-29 05:05:05,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:05,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758798785] [2023-11-29 05:05:05,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:05,611 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 05:05:05,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:05,612 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:05,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:05,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:05:05,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:05,732 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 05:05:05,750 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 05:05:05,750 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:05,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758798785] [2023-11-29 05:05:05,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758798785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:05,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:05,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:05:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322776604] [2023-11-29 05:05:05,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:05,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:05:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:05,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:05:05,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:05:05,753 INFO L87 Difference]: Start difference. First operand 950 states and 1008 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:08,763 INFO L93 Difference]: Finished difference Result 1318 states and 1408 transitions. [2023-11-29 05:05:08,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:05:08,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 05:05:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:08,769 INFO L225 Difference]: With dead ends: 1318 [2023-11-29 05:05:08,769 INFO L226 Difference]: Without dead ends: 1318 [2023-11-29 05:05:08,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:05:08,770 INFO L413 NwaCegarLoop]: 746 mSDtfsCounter, 400 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:08,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1225 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 05:05:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2023-11-29 05:05:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1051. [2023-11-29 05:05:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 535 states have (on average 2.2523364485981308) internal successors, (1205), 1046 states have internal predecessors, (1205), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1211 transitions. [2023-11-29 05:05:08,800 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1211 transitions. Word has length 3 [2023-11-29 05:05:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:08,800 INFO L495 AbstractCegarLoop]: Abstraction has 1051 states and 1211 transitions. [2023-11-29 05:05:08,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1211 transitions. [2023-11-29 05:05:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 05:05:08,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:08,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:08,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:09,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:09,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:09,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:09,003 INFO L85 PathProgramCache]: Analyzing trace with hash -230933561, now seen corresponding path program 1 times [2023-11-29 05:05:09,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:09,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987161623] [2023-11-29 05:05:09,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:09,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 05:05:09,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:09,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:09,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:09,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:05:09,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:09,172 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 05:05:09,179 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 05:05:09,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:05:09,262 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 05:05:09,283 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:05:09,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 05:05:09,306 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 05:05:09,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:09,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987161623] [2023-11-29 05:05:09,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987161623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:09,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:09,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:05:09,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287717652] [2023-11-29 05:05:09,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:09,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:09,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:09,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:09,308 INFO L87 Difference]: Start difference. First operand 1051 states and 1211 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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 05:05:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:12,556 INFO L93 Difference]: Finished difference Result 1205 states and 1373 transitions. [2023-11-29 05:05:12,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:12,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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 05:05:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:12,561 INFO L225 Difference]: With dead ends: 1205 [2023-11-29 05:05:12,562 INFO L226 Difference]: Without dead ends: 1205 [2023-11-29 05:05:12,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:12,563 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 1146 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:12,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 315 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 05:05:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2023-11-29 05:05:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 939. [2023-11-29 05:05:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 433 states have (on average 2.2863741339491916) internal successors, (990), 934 states have internal predecessors, (990), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 996 transitions. [2023-11-29 05:05:12,586 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 996 transitions. Word has length 7 [2023-11-29 05:05:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:12,586 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 996 transitions. [2023-11-29 05:05:12,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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 05:05:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 996 transitions. [2023-11-29 05:05:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 05:05:12,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:12,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:12,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:12,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:12,791 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:12,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:12,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1430994207, now seen corresponding path program 1 times [2023-11-29 05:05:12,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:12,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069584655] [2023-11-29 05:05:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:12,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:05:12,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:12,794 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:12,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:12,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:05:12,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:12,925 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 05:05:12,937 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 05:05:12,937 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:12,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:12,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069584655] [2023-11-29 05:05:12,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069584655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:12,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:12,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:05:12,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211779806] [2023-11-29 05:05:12,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:12,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:05:12,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:12,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:05:12,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:05:12,939 INFO L87 Difference]: Start difference. First operand 939 states and 996 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:14,840 INFO L93 Difference]: Finished difference Result 1079 states and 1157 transitions. [2023-11-29 05:05:14,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:05:14,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 05:05:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:14,846 INFO L225 Difference]: With dead ends: 1079 [2023-11-29 05:05:14,846 INFO L226 Difference]: Without dead ends: 1079 [2023-11-29 05:05:14,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:05:14,847 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 719 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:14,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 914 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 05:05:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2023-11-29 05:05:14,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 892. [2023-11-29 05:05:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 433 states have (on average 2.1778290993071594) internal successors, (943), 887 states have internal predecessors, (943), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 949 transitions. [2023-11-29 05:05:14,864 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 949 transitions. Word has length 8 [2023-11-29 05:05:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:14,865 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 949 transitions. [2023-11-29 05:05:14,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:14,865 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 949 transitions. [2023-11-29 05:05:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 05:05:14,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:14,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:14,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 05:05:15,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:15,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:15,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1430994208, now seen corresponding path program 1 times [2023-11-29 05:05:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:15,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004154959] [2023-11-29 05:05:15,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:15,069 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 05:05:15,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:15,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:15,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:15,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:05:15,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:15,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:05:15,202 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 05:05:15,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:15,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:15,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004154959] [2023-11-29 05:05:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004154959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:15,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:15,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:05:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980313509] [2023-11-29 05:05:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:15,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:05:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:05:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:05:15,205 INFO L87 Difference]: Start difference. First operand 892 states and 949 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:17,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:17,943 INFO L93 Difference]: Finished difference Result 1137 states and 1218 transitions. [2023-11-29 05:05:17,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:05:17,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 05:05:17,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:17,950 INFO L225 Difference]: With dead ends: 1137 [2023-11-29 05:05:17,950 INFO L226 Difference]: Without dead ends: 1137 [2023-11-29 05:05:17,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:05:17,952 INFO L413 NwaCegarLoop]: 857 mSDtfsCounter, 437 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:17,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1198 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 05:05:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2023-11-29 05:05:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 905. [2023-11-29 05:05:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 456 states have (on average 2.1710526315789473) internal successors, (990), 900 states have internal predecessors, (990), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 996 transitions. [2023-11-29 05:05:17,972 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 996 transitions. Word has length 8 [2023-11-29 05:05:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:17,973 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 996 transitions. [2023-11-29 05:05:17,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 996 transitions. [2023-11-29 05:05:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 05:05:17,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:17,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:17,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:18,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:18,174 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr425REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:18,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1834819724, now seen corresponding path program 1 times [2023-11-29 05:05:18,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:18,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210981826] [2023-11-29 05:05:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:18,175 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 05:05:18,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:18,176 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:18,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:18,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:05:18,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:18,348 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 05:05:18,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:18,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:18,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210981826] [2023-11-29 05:05:18,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210981826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:18,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:18,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:05:18,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718669208] [2023-11-29 05:05:18,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:18,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:05:18,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:18,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:05:18,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:05:18,351 INFO L87 Difference]: Start difference. First operand 905 states and 996 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:19,543 INFO L93 Difference]: Finished difference Result 1323 states and 1449 transitions. [2023-11-29 05:05:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:05:19,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 05:05:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:19,549 INFO L225 Difference]: With dead ends: 1323 [2023-11-29 05:05:19,549 INFO L226 Difference]: Without dead ends: 1323 [2023-11-29 05:05:19,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 05:05:19,550 INFO L413 NwaCegarLoop]: 874 mSDtfsCounter, 503 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:19,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1566 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:05:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2023-11-29 05:05:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1048. [2023-11-29 05:05:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 599 states have (on average 2.0901502504173624) internal successors, (1252), 1043 states have internal predecessors, (1252), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1258 transitions. [2023-11-29 05:05:19,568 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1258 transitions. Word has length 11 [2023-11-29 05:05:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:19,568 INFO L495 AbstractCegarLoop]: Abstraction has 1048 states and 1258 transitions. [2023-11-29 05:05:19,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1258 transitions. [2023-11-29 05:05:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 05:05:19,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:19,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:19,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:19,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:19,770 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:19,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:19,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1625377008, now seen corresponding path program 1 times [2023-11-29 05:05:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718933338] [2023-11-29 05:05:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:19,771 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 05:05:19,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:19,772 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:19,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:19,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:05:19,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:19,876 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 05:05:19,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:19,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:19,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718933338] [2023-11-29 05:05:19,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718933338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:19,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:19,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:05:19,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854457081] [2023-11-29 05:05:19,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:19,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:05:19,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:19,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:05:19,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:05:19,878 INFO L87 Difference]: Start difference. First operand 1048 states and 1258 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:20,636 INFO L93 Difference]: Finished difference Result 994 states and 1178 transitions. [2023-11-29 05:05:20,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:05:20,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 05:05:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:20,643 INFO L225 Difference]: With dead ends: 994 [2023-11-29 05:05:20,643 INFO L226 Difference]: Without dead ends: 994 [2023-11-29 05:05:20,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 05:05:20,644 INFO L413 NwaCegarLoop]: 777 mSDtfsCounter, 70 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:20,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1505 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:05:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2023-11-29 05:05:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2023-11-29 05:05:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 569 states have (on average 2.0597539543057994) internal successors, (1172), 989 states have internal predecessors, (1172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1178 transitions. [2023-11-29 05:05:20,681 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1178 transitions. Word has length 13 [2023-11-29 05:05:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:20,681 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 1178 transitions. [2023-11-29 05:05:20,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1178 transitions. [2023-11-29 05:05:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 05:05:20,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:20,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:20,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 05:05:20,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:20,884 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:20,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash 941513535, now seen corresponding path program 1 times [2023-11-29 05:05:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:20,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280396939] [2023-11-29 05:05:20,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:20,885 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 05:05:20,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:20,886 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:20,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:20,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:05:21,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:21,050 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 05:05:21,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:21,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:21,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280396939] [2023-11-29 05:05:21,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280396939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:21,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:21,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:05:21,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177335161] [2023-11-29 05:05:21,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:21,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:05:21,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:21,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:05:21,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:05:21,052 INFO L87 Difference]: Start difference. First operand 994 states and 1178 transitions. Second operand has 5 states, 5 states have (on average 2.8) 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 05:05:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:23,126 INFO L93 Difference]: Finished difference Result 1250 states and 1373 transitions. [2023-11-29 05:05:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:05:23,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) 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 05:05:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:23,132 INFO L225 Difference]: With dead ends: 1250 [2023-11-29 05:05:23,132 INFO L226 Difference]: Without dead ends: 1250 [2023-11-29 05:05:23,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:05:23,133 INFO L413 NwaCegarLoop]: 836 mSDtfsCounter, 480 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:23,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 2939 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 05:05:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-11-29 05:05:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 996. [2023-11-29 05:05:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 571 states have (on average 2.0560420315236425) internal successors, (1174), 991 states have internal predecessors, (1174), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1180 transitions. [2023-11-29 05:05:23,147 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1180 transitions. Word has length 14 [2023-11-29 05:05:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:23,148 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1180 transitions. [2023-11-29 05:05:23,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) 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 05:05:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1180 transitions. [2023-11-29 05:05:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 05:05:23,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:23,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:23,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:23,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:23,352 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr530ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:23,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash 941520445, now seen corresponding path program 1 times [2023-11-29 05:05:23,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:23,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391610247] [2023-11-29 05:05:23,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:23,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:05:23,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:23,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:23,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:23,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:05:23,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:23,618 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_54| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_54|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_54| (_ bv0 1)) |c_#valid|))) is different from true [2023-11-29 05:05:23,619 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 05:05:23,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:23,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391610247] [2023-11-29 05:05:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391610247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:23,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:23,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:05:23,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092974761] [2023-11-29 05:05:23,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:23,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:23,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 05:05:23,621 INFO L87 Difference]: Start difference. First operand 996 states and 1180 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 05:05:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:25,369 INFO L93 Difference]: Finished difference Result 1082 states and 1277 transitions. [2023-11-29 05:05:25,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:25,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 05:05:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:25,374 INFO L225 Difference]: With dead ends: 1082 [2023-11-29 05:05:25,374 INFO L226 Difference]: Without dead ends: 1076 [2023-11-29 05:05:25,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 05:05:25,374 INFO L413 NwaCegarLoop]: 770 mSDtfsCounter, 90 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 991 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:25,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1214 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 565 Invalid, 0 Unknown, 991 Unchecked, 1.7s Time] [2023-11-29 05:05:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2023-11-29 05:05:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1051. [2023-11-29 05:05:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 626 states have (on average 2.0175718849840254) internal successors, (1263), 1046 states have internal predecessors, (1263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1269 transitions. [2023-11-29 05:05:25,389 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1269 transitions. Word has length 14 [2023-11-29 05:05:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:25,389 INFO L495 AbstractCegarLoop]: Abstraction has 1051 states and 1269 transitions. [2023-11-29 05:05:25,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 05:05:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1269 transitions. [2023-11-29 05:05:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 05:05:25,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:25,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:25,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 05:05:25,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:25,591 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:25,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1380764822, now seen corresponding path program 1 times [2023-11-29 05:05:25,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:25,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799234470] [2023-11-29 05:05:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:25,591 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 05:05:25,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:25,592 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:25,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:25,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:05:25,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:25,727 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 05:05:25,727 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:25,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:25,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799234470] [2023-11-29 05:05:25,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799234470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:25,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:25,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:05:25,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016949896] [2023-11-29 05:05:25,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:25,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:25,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:25,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:25,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:25,729 INFO L87 Difference]: Start difference. First operand 1051 states and 1269 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 05:05:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:26,602 INFO L93 Difference]: Finished difference Result 1037 states and 1206 transitions. [2023-11-29 05:05:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:26,603 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 05:05:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:26,607 INFO L225 Difference]: With dead ends: 1037 [2023-11-29 05:05:26,607 INFO L226 Difference]: Without dead ends: 1037 [2023-11-29 05:05:26,607 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 05:05:26,608 INFO L413 NwaCegarLoop]: 746 mSDtfsCounter, 58 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:26,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2214 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:05:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2023-11-29 05:05:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1034. [2023-11-29 05:05:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 623 states have (on average 1.9213483146067416) internal successors, (1197), 1029 states have internal predecessors, (1197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1203 transitions. [2023-11-29 05:05:26,631 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1203 transitions. Word has length 15 [2023-11-29 05:05:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:26,631 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1203 transitions. [2023-11-29 05:05:26,631 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 05:05:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1203 transitions. [2023-11-29 05:05:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 05:05:26,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:26,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:26,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-29 05:05:26,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:26,835 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:26,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash 771501622, now seen corresponding path program 1 times [2023-11-29 05:05:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:26,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117383731] [2023-11-29 05:05:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:26,836 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 05:05:26,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:26,837 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:26,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:26,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:05:26,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:26,990 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 05:05:26,990 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:26,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:26,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117383731] [2023-11-29 05:05:26,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117383731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:26,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:26,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:05:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295233116] [2023-11-29 05:05:26,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:26,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:05:26,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:26,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:05:26,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:05:26,992 INFO L87 Difference]: Start difference. First operand 1034 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:27,687 INFO L93 Difference]: Finished difference Result 980 states and 1123 transitions. [2023-11-29 05:05:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:05:27,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 05:05:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:27,692 INFO L225 Difference]: With dead ends: 980 [2023-11-29 05:05:27,692 INFO L226 Difference]: Without dead ends: 980 [2023-11-29 05:05:27,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 05:05:27,693 INFO L413 NwaCegarLoop]: 719 mSDtfsCounter, 70 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:27,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1389 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:05:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2023-11-29 05:05:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2023-11-29 05:05:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 593 states have (on average 1.8836424957841484) internal successors, (1117), 975 states have internal predecessors, (1117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1123 transitions. [2023-11-29 05:05:27,706 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1123 transitions. Word has length 16 [2023-11-29 05:05:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:27,706 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1123 transitions. [2023-11-29 05:05:27,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1123 transitions. [2023-11-29 05:05:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 05:05:27,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:27,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:27,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:27,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:27,910 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:27,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1616286064, now seen corresponding path program 1 times [2023-11-29 05:05:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:27,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078235491] [2023-11-29 05:05:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:27,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:05:27,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:27,912 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:27,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:28,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:05:28,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:28,117 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 05:05:28,117 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:28,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:28,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078235491] [2023-11-29 05:05:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078235491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:28,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:28,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:05:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202836451] [2023-11-29 05:05:28,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:28,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:28,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:28,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:28,120 INFO L87 Difference]: Start difference. First operand 980 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 05:05:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:28,974 INFO L93 Difference]: Finished difference Result 966 states and 1081 transitions. [2023-11-29 05:05:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:28,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-11-29 05:05:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:28,979 INFO L225 Difference]: With dead ends: 966 [2023-11-29 05:05:28,979 INFO L226 Difference]: Without dead ends: 966 [2023-11-29 05:05:28,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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 05:05:28,980 INFO L413 NwaCegarLoop]: 688 mSDtfsCounter, 58 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:28,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2040 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:05:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-11-29 05:05:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2023-11-29 05:05:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 591 states have (on average 1.8155668358714043) internal successors, (1073), 959 states have internal predecessors, (1073), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1079 transitions. [2023-11-29 05:05:28,996 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1079 transitions. Word has length 18 [2023-11-29 05:05:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:28,996 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1079 transitions. [2023-11-29 05:05:28,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 05:05:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1079 transitions. [2023-11-29 05:05:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 05:05:28,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:28,998 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] [2023-11-29 05:05:29,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:29,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:29,199 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr378REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:29,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash 32152248, now seen corresponding path program 1 times [2023-11-29 05:05:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:29,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480200524] [2023-11-29 05:05:29,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:29,200 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 05:05:29,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:29,201 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:29,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:29,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:05:29,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:29,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 05:05:29,377 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 05:05:29,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:29,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480200524] [2023-11-29 05:05:29,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480200524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:29,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:29,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:05:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3936676] [2023-11-29 05:05:29,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:29,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:29,379 INFO L87 Difference]: Start difference. First operand 964 states and 1079 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 05:05:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:31,256 INFO L93 Difference]: Finished difference Result 1124 states and 1240 transitions. [2023-11-29 05:05:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-11-29 05:05:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:31,261 INFO L225 Difference]: With dead ends: 1124 [2023-11-29 05:05:31,261 INFO L226 Difference]: Without dead ends: 1124 [2023-11-29 05:05:31,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 05:05:31,262 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 706 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:31,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 926 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 05:05:31,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2023-11-29 05:05:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 960. [2023-11-29 05:05:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 591 states have (on average 1.7952622673434857) internal successors, (1061), 955 states have internal predecessors, (1061), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1067 transitions. [2023-11-29 05:05:31,274 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1067 transitions. Word has length 29 [2023-11-29 05:05:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:31,275 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1067 transitions. [2023-11-29 05:05:31,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 05:05:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1067 transitions. [2023-11-29 05:05:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 05:05:31,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:31,276 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] [2023-11-29 05:05:31,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:31,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:31,476 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr379REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:31,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:31,477 INFO L85 PathProgramCache]: Analyzing trace with hash 32152249, now seen corresponding path program 1 times [2023-11-29 05:05:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:31,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049650003] [2023-11-29 05:05:31,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:31,477 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 05:05:31,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:31,478 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:31,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:31,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:05:31,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:31,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:05:31,740 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 05:05:31,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:31,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:31,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049650003] [2023-11-29 05:05:31,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049650003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:31,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:31,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:05:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085804038] [2023-11-29 05:05:31,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:31,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:31,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:31,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:31,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:31,741 INFO L87 Difference]: Start difference. First operand 960 states and 1067 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 05:05:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:34,360 INFO L93 Difference]: Finished difference Result 963 states and 1065 transitions. [2023-11-29 05:05:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-11-29 05:05:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:34,365 INFO L225 Difference]: With dead ends: 963 [2023-11-29 05:05:34,365 INFO L226 Difference]: Without dead ends: 963 [2023-11-29 05:05:34,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 05:05:34,366 INFO L413 NwaCegarLoop]: 699 mSDtfsCounter, 68 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:34,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1437 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 05:05:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-11-29 05:05:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 960. [2023-11-29 05:05:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 591 states have (on average 1.7884940778341794) internal successors, (1057), 955 states have internal predecessors, (1057), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1063 transitions. [2023-11-29 05:05:34,382 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1063 transitions. Word has length 29 [2023-11-29 05:05:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:34,382 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1063 transitions. [2023-11-29 05:05:34,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 05:05:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1063 transitions. [2023-11-29 05:05:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 05:05:34,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:34,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, 1] [2023-11-29 05:05:34,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:34,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:34,584 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:34,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:34,585 INFO L85 PathProgramCache]: Analyzing trace with hash 430509822, now seen corresponding path program 1 times [2023-11-29 05:05:34,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:34,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246469536] [2023-11-29 05:05:34,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:34,585 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 05:05:34,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:34,586 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:34,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:34,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:05:34,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:34,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:05:34,793 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 05:05:34,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:34,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246469536] [2023-11-29 05:05:34,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246469536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:34,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:34,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:05:34,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114019862] [2023-11-29 05:05:34,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:34,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:34,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:34,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:34,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:34,796 INFO L87 Difference]: Start difference. First operand 960 states and 1063 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 05:05:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:36,736 INFO L93 Difference]: Finished difference Result 1140 states and 1262 transitions. [2023-11-29 05:05:36,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:36,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2023-11-29 05:05:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:36,741 INFO L225 Difference]: With dead ends: 1140 [2023-11-29 05:05:36,741 INFO L226 Difference]: Without dead ends: 1140 [2023-11-29 05:05:36,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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 05:05:36,742 INFO L413 NwaCegarLoop]: 502 mSDtfsCounter, 580 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:36,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1058 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 05:05:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2023-11-29 05:05:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 956. [2023-11-29 05:05:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 591 states have (on average 1.7749576988155669) internal successors, (1049), 951 states have internal predecessors, (1049), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1055 transitions. [2023-11-29 05:05:36,753 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1055 transitions. Word has length 32 [2023-11-29 05:05:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:36,754 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 1055 transitions. [2023-11-29 05:05:36,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 05:05:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1055 transitions. [2023-11-29 05:05:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 05:05:36,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:36,755 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] [2023-11-29 05:05:36,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:36,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:36,955 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:36,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:36,955 INFO L85 PathProgramCache]: Analyzing trace with hash 430509823, now seen corresponding path program 1 times [2023-11-29 05:05:36,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:36,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542264768] [2023-11-29 05:05:36,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:36,956 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 05:05:36,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:36,957 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:36,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:37,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:05:37,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:37,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:05:37,237 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 05:05:37,237 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:37,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:37,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542264768] [2023-11-29 05:05:37,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542264768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:37,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:37,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:05:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260005794] [2023-11-29 05:05:37,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:37,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:37,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:37,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:37,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:37,239 INFO L87 Difference]: Start difference. First operand 956 states and 1055 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 05:05:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:40,087 INFO L93 Difference]: Finished difference Result 1181 states and 1268 transitions. [2023-11-29 05:05:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:40,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2023-11-29 05:05:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:40,093 INFO L225 Difference]: With dead ends: 1181 [2023-11-29 05:05:40,093 INFO L226 Difference]: Without dead ends: 1181 [2023-11-29 05:05:40,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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 05:05:40,094 INFO L413 NwaCegarLoop]: 787 mSDtfsCounter, 300 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:40,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1548 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 05:05:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2023-11-29 05:05:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 952. [2023-11-29 05:05:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 591 states have (on average 1.7614213197969544) internal successors, (1041), 947 states have internal predecessors, (1041), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1047 transitions. [2023-11-29 05:05:40,104 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1047 transitions. Word has length 32 [2023-11-29 05:05:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:40,104 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1047 transitions. [2023-11-29 05:05:40,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 05:05:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1047 transitions. [2023-11-29 05:05:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:05:40,106 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:40,106 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] [2023-11-29 05:05:40,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:40,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:40,306 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr420ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:40,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:40,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1197752889, now seen corresponding path program 1 times [2023-11-29 05:05:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:40,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004500501] [2023-11-29 05:05:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:40,307 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 05:05:40,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:40,308 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:40,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:40,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:05:40,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:40,472 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 05:05:40,472 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:40,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:40,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004500501] [2023-11-29 05:05:40,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004500501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:40,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:40,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:05:40,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226056475] [2023-11-29 05:05:40,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:40,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:40,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:40,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:40,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:40,474 INFO L87 Difference]: Start difference. First operand 952 states and 1047 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:41,303 INFO L93 Difference]: Finished difference Result 934 states and 1017 transitions. [2023-11-29 05:05:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:41,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-11-29 05:05:41,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:41,309 INFO L225 Difference]: With dead ends: 934 [2023-11-29 05:05:41,309 INFO L226 Difference]: Without dead ends: 934 [2023-11-29 05:05:41,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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 05:05:41,310 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 31 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:41,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2006 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:05:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2023-11-29 05:05:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2023-11-29 05:05:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 573 states have (on average 1.7643979057591623) internal successors, (1011), 929 states have internal predecessors, (1011), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:41,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1017 transitions. [2023-11-29 05:05:41,322 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1017 transitions. Word has length 49 [2023-11-29 05:05:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:41,322 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1017 transitions. [2023-11-29 05:05:41,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1017 transitions. [2023-11-29 05:05:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 05:05:41,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:41,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:41,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:41,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:41,523 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:41,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:41,524 INFO L85 PathProgramCache]: Analyzing trace with hash 260949999, now seen corresponding path program 1 times [2023-11-29 05:05:41,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:41,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272016757] [2023-11-29 05:05:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:41,524 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 05:05:41,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:41,525 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:41,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:41,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:05:41,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:41,762 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 05:05:41,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:41,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:41,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272016757] [2023-11-29 05:05:41,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272016757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:41,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:41,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:05:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667403884] [2023-11-29 05:05:41,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:41,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:41,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:41,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:41,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:41,764 INFO L87 Difference]: Start difference. First operand 934 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:42,712 INFO L93 Difference]: Finished difference Result 922 states and 997 transitions. [2023-11-29 05:05:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:42,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-29 05:05:42,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:42,717 INFO L225 Difference]: With dead ends: 922 [2023-11-29 05:05:42,717 INFO L226 Difference]: Without dead ends: 922 [2023-11-29 05:05:42,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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 05:05:42,718 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 23 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:42,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2002 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:05:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2023-11-29 05:05:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2023-11-29 05:05:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 561 states have (on average 1.7664884135472372) internal successors, (991), 917 states have internal predecessors, (991), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 997 transitions. [2023-11-29 05:05:42,728 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 997 transitions. Word has length 51 [2023-11-29 05:05:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:42,728 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 997 transitions. [2023-11-29 05:05:42,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:05:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 997 transitions. [2023-11-29 05:05:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 05:05:42,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:42,729 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] [2023-11-29 05:05:42,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:42,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:42,929 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr420ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:42,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1312593031, now seen corresponding path program 1 times [2023-11-29 05:05:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:42,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741766641] [2023-11-29 05:05:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:42,930 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 05:05:42,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:42,931 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:42,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:43,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:05:43,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:43,142 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:05:43,143 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:05:43,143 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:05:43,146 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 05:05:43,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:05:43,211 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 05:05:43,250 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 05:05:43,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:43,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:43,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741766641] [2023-11-29 05:05:43,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741766641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:43,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:43,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:05:43,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730801415] [2023-11-29 05:05:43,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:43,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:05:43,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:43,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:05:43,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:05:43,253 INFO L87 Difference]: Start difference. First operand 922 states and 997 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 05:05:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:45,321 INFO L93 Difference]: Finished difference Result 1543 states and 1649 transitions. [2023-11-29 05:05:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:05:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2023-11-29 05:05:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:45,327 INFO L225 Difference]: With dead ends: 1543 [2023-11-29 05:05:45,327 INFO L226 Difference]: Without dead ends: 1540 [2023-11-29 05:05:45,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:05:45,328 INFO L413 NwaCegarLoop]: 856 mSDtfsCounter, 1489 mSDsluCounter, 2375 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 3231 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:45,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 3231 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 05:05:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2023-11-29 05:05:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 873. [2023-11-29 05:05:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 512 states have (on average 1.8359375) internal successors, (940), 868 states have internal predecessors, (940), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 946 transitions. [2023-11-29 05:05:45,342 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 946 transitions. Word has length 53 [2023-11-29 05:05:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:45,342 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 946 transitions. [2023-11-29 05:05:45,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 05:05:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 946 transitions. [2023-11-29 05:05:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 05:05:45,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:45,343 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] [2023-11-29 05:05:45,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:45,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:45,543 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:45,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash 167829997, now seen corresponding path program 1 times [2023-11-29 05:05:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:45,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179579754] [2023-11-29 05:05:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:45,544 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 05:05:45,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:45,545 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:45,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:45,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:05:45,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:45,853 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 05:05:45,857 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 05:05:46,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:05:46,260 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 05:05:46,270 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:05:46,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 05:05:46,285 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 05:05:46,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:46,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:46,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179579754] [2023-11-29 05:05:46,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179579754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:46,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:46,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:05:46,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468200850] [2023-11-29 05:05:46,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:46,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:46,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:46,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:46,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:46,287 INFO L87 Difference]: Start difference. First operand 873 states and 946 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 05:05:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:48,487 INFO L93 Difference]: Finished difference Result 1007 states and 1095 transitions. [2023-11-29 05:05:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:48,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2023-11-29 05:05:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:48,491 INFO L225 Difference]: With dead ends: 1007 [2023-11-29 05:05:48,491 INFO L226 Difference]: Without dead ends: 1007 [2023-11-29 05:05:48,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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 05:05:48,492 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 613 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:48,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 535 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 05:05:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2023-11-29 05:05:48,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 812. [2023-11-29 05:05:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 489 states have (on average 1.7280163599182004) internal successors, (845), 807 states have internal predecessors, (845), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 851 transitions. [2023-11-29 05:05:48,502 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 851 transitions. Word has length 55 [2023-11-29 05:05:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:48,502 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 851 transitions. [2023-11-29 05:05:48,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 05:05:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 851 transitions. [2023-11-29 05:05:48,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 05:05:48,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:48,503 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] [2023-11-29 05:05:48,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:48,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:48,704 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:48,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash -937894595, now seen corresponding path program 1 times [2023-11-29 05:05:48,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:48,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113461551] [2023-11-29 05:05:48,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:48,705 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 05:05:48,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:48,705 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:48,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:48,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:05:48,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:48,945 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 05:05:48,960 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 05:05:48,982 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 05:05:48,992 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 05:05:48,992 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:48,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:48,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113461551] [2023-11-29 05:05:48,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113461551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:48,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:48,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:05:48,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958688247] [2023-11-29 05:05:48,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:48,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:05:48,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:48,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:05:48,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:05:48,994 INFO L87 Difference]: Start difference. First operand 812 states and 851 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 05:05:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:51,202 INFO L93 Difference]: Finished difference Result 811 states and 850 transitions. [2023-11-29 05:05:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:05:51,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2023-11-29 05:05:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:51,205 INFO L225 Difference]: With dead ends: 811 [2023-11-29 05:05:51,205 INFO L226 Difference]: Without dead ends: 811 [2023-11-29 05:05:51,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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 05:05:51,206 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 3 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:51,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1681 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 05:05:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2023-11-29 05:05:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2023-11-29 05:05:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 489 states have (on average 1.7259713701431494) internal successors, (844), 806 states have internal predecessors, (844), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 850 transitions. [2023-11-29 05:05:51,217 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 850 transitions. Word has length 59 [2023-11-29 05:05:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:51,217 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 850 transitions. [2023-11-29 05:05:51,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 05:05:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 850 transitions. [2023-11-29 05:05:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 05:05:51,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:51,218 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] [2023-11-29 05:05:51,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:51,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:51,419 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:51,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:51,419 INFO L85 PathProgramCache]: Analyzing trace with hash -937894594, now seen corresponding path program 1 times [2023-11-29 05:05:51,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:51,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179104675] [2023-11-29 05:05:51,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:51,420 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 05:05:51,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:51,421 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:51,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:51,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:05:51,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:51,672 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 05:05:51,691 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 05:05:51,700 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 05:05:51,735 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 05:05:51,751 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 05:05:51,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:51,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:51,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179104675] [2023-11-29 05:05:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179104675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:51,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:05:51,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163490884] [2023-11-29 05:05:51,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:51,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:05:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:05:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:05:51,753 INFO L87 Difference]: Start difference. First operand 811 states and 850 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 05:05:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:54,765 INFO L93 Difference]: Finished difference Result 810 states and 849 transitions. [2023-11-29 05:05:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:05:54,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2023-11-29 05:05:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:54,770 INFO L225 Difference]: With dead ends: 810 [2023-11-29 05:05:54,770 INFO L226 Difference]: Without dead ends: 810 [2023-11-29 05:05:54,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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 05:05:54,771 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 1 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:54,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1703 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 05:05:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2023-11-29 05:05:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 810. [2023-11-29 05:05:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 488 states have (on average 1.7274590163934427) internal successors, (843), 805 states have internal predecessors, (843), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:05:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 849 transitions. [2023-11-29 05:05:54,782 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 849 transitions. Word has length 59 [2023-11-29 05:05:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:54,782 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 849 transitions. [2023-11-29 05:05:54,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 05:05:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 849 transitions. [2023-11-29 05:05:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 05:05:54,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:54,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:05:54,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:54,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:54,984 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:54,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1733308001, now seen corresponding path program 1 times [2023-11-29 05:05:54,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:54,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111190375] [2023-11-29 05:05:54,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:54,985 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 05:05:54,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:54,986 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:54,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-29 05:05:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:55,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:05:55,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:55,260 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 05:05:55,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:05:55,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:55,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111190375] [2023-11-29 05:05:55,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111190375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:55,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:55,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:05:55,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865116613] [2023-11-29 05:05:55,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:55,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:05:55,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:55,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:05:55,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:05:55,262 INFO L87 Difference]: Start difference. First operand 810 states and 849 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 05:05:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:56,141 INFO L93 Difference]: Finished difference Result 812 states and 852 transitions. [2023-11-29 05:05:56,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:05:56,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2023-11-29 05:05:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:56,147 INFO L225 Difference]: With dead ends: 812 [2023-11-29 05:05:56,147 INFO L226 Difference]: Without dead ends: 812 [2023-11-29 05:05:56,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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 05:05:56,148 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 1 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:56,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1941 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:05:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2023-11-29 05:05:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2023-11-29 05:05:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 489 states have (on average 1.7280163599182004) internal successors, (845), 807 states have internal predecessors, (845), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:05:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 852 transitions. [2023-11-29 05:05:56,164 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 852 transitions. Word has length 65 [2023-11-29 05:05:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:56,165 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 852 transitions. [2023-11-29 05:05:56,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 05:05:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 852 transitions. [2023-11-29 05:05:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 05:05:56,166 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:56,166 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, 1] [2023-11-29 05:05:56,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-11-29 05:05:56,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:56,366 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:56,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash 902827578, now seen corresponding path program 1 times [2023-11-29 05:05:56,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:56,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841328350] [2023-11-29 05:05:56,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:56,367 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 05:05:56,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:56,368 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:56,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:56,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:05:56,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:56,644 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 05:05:56,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:05:56,703 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 05:05:56,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:56,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841328350] [2023-11-29 05:05:56,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841328350] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:05:56,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:05:56,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 05:05:56,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994175801] [2023-11-29 05:05:56,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:05:56,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:05:56,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:56,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:05:56,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:05:56,705 INFO L87 Difference]: Start difference. First operand 812 states and 852 transitions. Second operand has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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 05:05:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:57,770 INFO L93 Difference]: Finished difference Result 821 states and 866 transitions. [2023-11-29 05:05:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:05:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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 66 [2023-11-29 05:05:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:57,773 INFO L225 Difference]: With dead ends: 821 [2023-11-29 05:05:57,773 INFO L226 Difference]: Without dead ends: 821 [2023-11-29 05:05:57,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 124 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 05:05:57,774 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 7 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:57,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1939 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:05:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2023-11-29 05:05:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 820. [2023-11-29 05:05:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 496 states have (on average 1.7298387096774193) internal successors, (858), 814 states have internal predecessors, (858), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:05:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 865 transitions. [2023-11-29 05:05:57,786 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 865 transitions. Word has length 66 [2023-11-29 05:05:57,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:57,787 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 865 transitions. [2023-11-29 05:05:57,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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 05:05:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 865 transitions. [2023-11-29 05:05:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 05:05:57,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:57,788 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, 1] [2023-11-29 05:05:57,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:57,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:57,992 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:57,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:57,992 INFO L85 PathProgramCache]: Analyzing trace with hash -130687839, now seen corresponding path program 2 times [2023-11-29 05:05:57,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:57,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007990479] [2023-11-29 05:05:57,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:05:57,993 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 05:05:57,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:57,994 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:05:57,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-29 05:05:58,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:05:58,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:05:58,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:05:58,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:58,472 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 05:05:58,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:05:58,631 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 05:05:58,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:58,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007990479] [2023-11-29 05:05:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007990479] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:05:58,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:05:58,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 05:05:58,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772040012] [2023-11-29 05:05:58,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:05:58,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:05:58,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:58,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:05:58,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:05:58,634 INFO L87 Difference]: Start difference. First operand 820 states and 865 transitions. Second operand has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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 05:06:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:01,315 INFO L93 Difference]: Finished difference Result 835 states and 887 transitions. [2023-11-29 05:06:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 05:06:01,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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 69 [2023-11-29 05:06:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:01,318 INFO L225 Difference]: With dead ends: 835 [2023-11-29 05:06:01,318 INFO L226 Difference]: Without dead ends: 833 [2023-11-29 05:06:01,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 124 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 05:06:01,319 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 13 mSDsluCounter, 4520 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5167 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:01,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5167 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 05:06:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2023-11-29 05:06:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 829. [2023-11-29 05:06:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 505 states have (on average 1.7227722772277227) internal successors, (870), 823 states have internal predecessors, (870), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:06:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 877 transitions. [2023-11-29 05:06:01,331 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 877 transitions. Word has length 69 [2023-11-29 05:06:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:01,331 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 877 transitions. [2023-11-29 05:06:01,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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 05:06:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 877 transitions. [2023-11-29 05:06:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 05:06:01,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:01,333 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, 1] [2023-11-29 05:06:01,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-11-29 05:06:01,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:06:01,533 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:06:01,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1819887105, now seen corresponding path program 3 times [2023-11-29 05:06:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:06:01,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318731793] [2023-11-29 05:06:01,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:06:01,534 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 05:06:01,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:06:01,535 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:06:01,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:06:02,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 05:06:02,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:06:02,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:06:02,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:06:02,331 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 05:06:02,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:06:02,950 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 05:06:02,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:06:02,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318731793] [2023-11-29 05:06:02,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318731793] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:06:02,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:06:02,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 05:06:02,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168268588] [2023-11-29 05:06:02,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:06:02,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:06:02,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:06:02,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:06:02,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:06:02,952 INFO L87 Difference]: Start difference. First operand 829 states and 877 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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 05:06:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:08,533 INFO L93 Difference]: Finished difference Result 859 states and 927 transitions. [2023-11-29 05:06:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 05:06:08,534 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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 75 [2023-11-29 05:06:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:08,537 INFO L225 Difference]: With dead ends: 859 [2023-11-29 05:06:08,537 INFO L226 Difference]: Without dead ends: 856 [2023-11-29 05:06:08,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 05:06:08,538 INFO L413 NwaCegarLoop]: 646 mSDtfsCounter, 25 mSDsluCounter, 7737 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8383 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:08,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8383 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1806 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-11-29 05:06:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2023-11-29 05:06:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 847. [2023-11-29 05:06:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 523 states have (on average 1.7074569789674952) internal successors, (893), 841 states have internal predecessors, (893), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:06:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 900 transitions. [2023-11-29 05:06:08,551 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 900 transitions. Word has length 75 [2023-11-29 05:06:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:08,551 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 900 transitions. [2023-11-29 05:06:08,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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 05:06:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 900 transitions. [2023-11-29 05:06:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 05:06:08,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:08,552 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, 1] [2023-11-29 05:06:08,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:06:08,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:06:08,752 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:06:08,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash -38764351, now seen corresponding path program 4 times [2023-11-29 05:06:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:06:08,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075799018] [2023-11-29 05:06:08,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:06:08,753 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 05:06:08,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:06:08,754 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:06:08,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-29 05:06:09,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:06:09,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:06:09,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 05:06:09,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:06:09,449 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 05:06:09,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:06:11,038 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 05:06:11,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:06:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075799018] [2023-11-29 05:06:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075799018] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:06:11,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:06:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 05:06:11,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795364519] [2023-11-29 05:06:11,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:06:11,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 05:06:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:06:11,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 05:06:11,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 05:06:11,042 INFO L87 Difference]: Start difference. First operand 847 states and 900 transitions. Second operand has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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 05:06:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:06:24,147 INFO L93 Difference]: Finished difference Result 904 states and 989 transitions. [2023-11-29 05:06:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 05:06:24,148 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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 87 [2023-11-29 05:06:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:06:24,151 INFO L225 Difference]: With dead ends: 904 [2023-11-29 05:06:24,151 INFO L226 Difference]: Without dead ends: 902 [2023-11-29 05:06:24,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 05:06:24,156 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 48 mSDsluCounter, 16148 mSDsCounter, 0 mSdLazyCounter, 4565 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16795 SdHoareTripleChecker+Invalid, 4623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 4565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:06:24,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16795 Invalid, 4623 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 4565 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 05:06:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2023-11-29 05:06:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 881. [2023-11-29 05:06:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 557 states have (on average 1.6858168761220826) internal successors, (939), 875 states have internal predecessors, (939), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:06:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 946 transitions. [2023-11-29 05:06:24,172 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 946 transitions. Word has length 87 [2023-11-29 05:06:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:06:24,172 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 946 transitions. [2023-11-29 05:06:24,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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 05:06:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 946 transitions. [2023-11-29 05:06:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 05:06:24,173 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:06:24,173 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] [2023-11-29 05:06:24,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-11-29 05:06:24,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:06:24,375 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:06:24,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:06:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1103153953, now seen corresponding path program 5 times [2023-11-29 05:06:24,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:06:24,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217467945] [2023-11-29 05:06:24,379 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:06:24,379 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 05:06:24,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:06:24,382 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:06:24,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:06:25,785 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 05:06:25,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:06:25,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 05:06:25,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:06:25,827 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 05:06:25,926 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:06:25,926 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 05:06:25,949 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 05:06:26,033 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 05:06:26,905 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:06:26,906 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 05:06:26,942 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 05:06:26,973 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 05:06:26,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:06:31,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:06:31,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217467945] [2023-11-29 05:06:31,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217467945] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:06:31,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [489163730] [2023-11-29 05:06:31,447 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:06:31,447 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:06:31,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:06:31,448 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:06:31,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 05:07:33,839 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 05:07:33,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:07:34,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 05:07:34,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:34,082 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 05:07:34,416 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:07:34,417 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 05:07:34,489 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 05:07:34,628 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 05:07:35,620 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:07:35,620 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 05:07:35,692 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 05:07:35,703 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 05:07:35,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [489163730] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:37,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:07:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 05:07:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280402611] [2023-11-29 05:07:37,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:07:37,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:07:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:07:37,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=184, Unknown=3, NotChecked=0, Total=240 [2023-11-29 05:07:37,977 INFO L87 Difference]: Start difference. First operand 881 states and 946 transitions. Second operand has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 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 05:07:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:43,709 INFO L93 Difference]: Finished difference Result 1054 states and 1132 transitions. [2023-11-29 05:07:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:07:43,710 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 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 109 [2023-11-29 05:07:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:43,711 INFO L225 Difference]: With dead ends: 1054 [2023-11-29 05:07:43,712 INFO L226 Difference]: Without dead ends: 1052 [2023-11-29 05:07:43,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=62, Invalid=207, Unknown=3, NotChecked=0, Total=272 [2023-11-29 05:07:43,712 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 468 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 2389 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:43,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 2389 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-11-29 05:07:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2023-11-29 05:07:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 880. [2023-11-29 05:07:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 557 states have (on average 1.6768402154398563) internal successors, (934), 874 states have internal predecessors, (934), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:07:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 941 transitions. [2023-11-29 05:07:43,724 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 941 transitions. Word has length 109 [2023-11-29 05:07:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:43,724 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 941 transitions. [2023-11-29 05:07:43,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 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 05:07:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 941 transitions. [2023-11-29 05:07:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 05:07:43,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:43,725 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] [2023-11-29 05:07:43,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:07:43,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 05:07:44,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:07:44,126 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:07:44,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1103153954, now seen corresponding path program 1 times [2023-11-29 05:07:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510527311] [2023-11-29 05:07:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:44,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:07:44,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:44,128 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:07:44,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:07:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 05:07:44,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:44,838 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 05:07:44,953 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 05:07:44,964 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:07:44,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 05:07:44,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 05:07:45,000 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 05:07:45,102 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 05:07:45,107 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 05:07:45,822 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:07:45,822 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 05:07:45,835 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 05:07:45,889 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 05:07:45,895 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 05:07:45,925 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 05:07:45,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:47,400 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3214 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:07:47,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:47,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510527311] [2023-11-29 05:07:47,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510527311] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:47,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1189855187] [2023-11-29 05:07:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:47,408 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:07:47,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:07:47,409 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:07:47,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 05:09:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:28,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 05:09:28,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:09:28,597 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 05:09:28,897 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:09:28,897 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 05:09:28,906 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 05:09:28,961 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 05:09:28,967 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 05:09:29,119 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 05:09:29,123 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 05:09:29,830 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:29,830 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 05:09:29,839 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 05:09:29,920 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 05:09:29,925 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 05:09:29,929 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 05:09:29,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:09:31,210 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3770 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3770) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_3769 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3770 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3770) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3769) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:09:31,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1189855187] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:31,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:09:31,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 05:09:31,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357981028] [2023-11-29 05:09:31,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:09:31,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:09:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:09:31,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:09:31,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 05:09:31,217 INFO L87 Difference]: Start difference. First operand 880 states and 941 transitions. Second operand has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 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 05:09:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:09:42,115 INFO L93 Difference]: Finished difference Result 1051 states and 1127 transitions. [2023-11-29 05:09:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:09:42,116 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 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 109 [2023-11-29 05:09:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:09:42,119 INFO L225 Difference]: With dead ends: 1051 [2023-11-29 05:09:42,119 INFO L226 Difference]: Without dead ends: 1051 [2023-11-29 05:09:42,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 206 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 05:09:42,120 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 888 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 4433 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 2549 SdHoareTripleChecker+Invalid, 4448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:09:42,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 2549 Invalid, 4448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4433 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2023-11-29 05:09:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2023-11-29 05:09:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 879. [2023-11-29 05:09:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 557 states have (on average 1.675044883303411) internal successors, (933), 873 states have internal predecessors, (933), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:09:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 940 transitions. [2023-11-29 05:09:42,138 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 940 transitions. Word has length 109 [2023-11-29 05:09:42,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:09:42,138 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 940 transitions. [2023-11-29 05:09:42,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 states have internal predecessors, (121), 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 05:09:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 940 transitions. [2023-11-29 05:09:42,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 05:09:42,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:09:42,140 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] [2023-11-29 05:09:42,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-11-29 05:09:42,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 05:09:42,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:09:42,540 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:09:42,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:42,541 INFO L85 PathProgramCache]: Analyzing trace with hash -724622249, now seen corresponding path program 1 times [2023-11-29 05:09:42,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:09:42,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412846777] [2023-11-29 05:09:42,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:42,542 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 05:09:42,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:09:42,543 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:09:42,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:09:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:43,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 05:09:43,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:09:43,316 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 05:09:43,478 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:09:43,478 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 05:09:43,505 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 05:09:43,598 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 05:09:44,471 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:09:44,472 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 05:09:44,601 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:09:44,601 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 05:09:44,614 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 05:09:44,653 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 05:09:44,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:09:48,776 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4194 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 05:09:49,180 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4240 (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$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4240))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4194)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:09:49,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:09:49,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412846777] [2023-11-29 05:09:49,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412846777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:49,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [946114473] [2023-11-29 05:09:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:49,184 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:09:49,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:09:49,185 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:09:49,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 05:09:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:51,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 05:09:51,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:09:51,404 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 05:09:51,743 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:09:51,743 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 05:09:51,815 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 05:09:52,001 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 05:09:52,851 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:52,851 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 05:09:52,999 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:53,000 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 05:09:53,016 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 05:09:53,026 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 05:09:53,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:09:57,512 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4711))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4194)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:09:57,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [946114473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:57,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:09:57,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 05:09:57,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606707768] [2023-11-29 05:09:57,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:09:57,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:09:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:09:57,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:09:57,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=240, Unknown=6, NotChecked=102, Total=420 [2023-11-29 05:09:57,516 INFO L87 Difference]: Start difference. First operand 879 states and 940 transitions. Second operand has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 05:10:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:10:03,823 INFO L93 Difference]: Finished difference Result 1050 states and 1126 transitions. [2023-11-29 05:10:03,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:10:03,824 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 111 [2023-11-29 05:10:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:10:03,826 INFO L225 Difference]: With dead ends: 1050 [2023-11-29 05:10:03,826 INFO L226 Difference]: Without dead ends: 1050 [2023-11-29 05:10:03,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=81, Invalid=267, Unknown=6, NotChecked=108, Total=462 [2023-11-29 05:10:03,826 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 869 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 2512 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:10:03,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 2310 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2512 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-11-29 05:10:03,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2023-11-29 05:10:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 878. [2023-11-29 05:10:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 557 states have (on average 1.6732495511669658) internal successors, (932), 872 states have internal predecessors, (932), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:10:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 939 transitions. [2023-11-29 05:10:03,837 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 939 transitions. Word has length 111 [2023-11-29 05:10:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:10:03,837 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 939 transitions. [2023-11-29 05:10:03,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 05:10:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 939 transitions. [2023-11-29 05:10:03,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 05:10:03,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:10:03,838 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] [2023-11-29 05:10:03,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:10:04,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 05:10:04,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:10:04,239 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:10:04,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:10:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash -724622248, now seen corresponding path program 1 times [2023-11-29 05:10:04,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:10:04,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616330102] [2023-11-29 05:10:04,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:10:04,240 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 05:10:04,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:10:04,241 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:10:04,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:10:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:05,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 05:10:05,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:10:05,133 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 05:10:05,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 05:10:05,289 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:10:05,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 05:10:05,326 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 05:10:05,339 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 05:10:05,468 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 05:10:05,474 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 05:10:06,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:10:06,270 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 05:10:06,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 05:10:06,401 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:10:06,401 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 05:10:06,411 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 05:10:06,429 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 05:10:06,439 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 05:10:06,469 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 05:10:06,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:10:06,645 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5181 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5182) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:10:06,682 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5181 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5182) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 05:10:07,955 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5273))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5274) .cse0 v_ArrVal_5181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5182) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5274) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 05:10:07,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:10:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616330102] [2023-11-29 05:10:07,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616330102] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:10:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [368446088] [2023-11-29 05:10:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:10:07,963 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:10:07,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:10:07,964 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:10:07,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 05:11:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:51,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 05:11:52,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:11:52,013 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 05:11:52,333 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 05:11:52,348 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:11:52,348 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 05:11:52,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:11:52,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:11:52,583 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 05:11:52,587 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 05:11:53,232 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:11:53,233 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 05:11:53,238 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 05:11:53,432 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:11:53,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 05:11:53,441 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 05:11:53,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 05:11:53,470 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 05:11:53,471 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 05:11:53,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:11:53,522 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5744 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5744) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5744 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5745 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5744) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5745) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:11:53,555 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5744 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5744) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5744 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5745 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5744) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5745) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 05:11:55,063 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5837 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5744 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5837))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5836) .cse0 v_ArrVal_5744) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5745) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5837 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5744 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5836) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5744) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 05:11:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [368446088] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:11:55,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:11:55,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 05:11:55,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264606239] [2023-11-29 05:11:55,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:11:55,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:11:55,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:11:55,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:11:55,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 05:11:55,078 INFO L87 Difference]: Start difference. First operand 878 states and 939 transitions. Second operand has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 05:12:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:08,428 INFO L93 Difference]: Finished difference Result 1049 states and 1125 transitions. [2023-11-29 05:12:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:12:08,429 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 111 [2023-11-29 05:12:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:08,431 INFO L225 Difference]: With dead ends: 1049 [2023-11-29 05:12:08,431 INFO L226 Difference]: Without dead ends: 1049 [2023-11-29 05:12:08,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 05:12:08,432 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 468 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 5573 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 3200 SdHoareTripleChecker+Invalid, 5582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 5573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:08,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 3200 Invalid, 5582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 5573 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2023-11-29 05:12:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2023-11-29 05:12:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 877. [2023-11-29 05:12:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 557 states have (on average 1.6714542190305206) internal successors, (931), 871 states have internal predecessors, (931), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:12:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 938 transitions. [2023-11-29 05:12:08,445 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 938 transitions. Word has length 111 [2023-11-29 05:12:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:08,446 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 938 transitions. [2023-11-29 05:12:08,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 05:12:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 938 transitions. [2023-11-29 05:12:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 05:12:08,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:08,447 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] [2023-11-29 05:12:08,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:08,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2023-11-29 05:12:08,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:12:08,848 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:12:08,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:08,848 INFO L85 PathProgramCache]: Analyzing trace with hash -575932887, now seen corresponding path program 1 times [2023-11-29 05:12:08,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:08,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061260192] [2023-11-29 05:12:08,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:08,849 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 05:12:08,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:08,850 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:08,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:09,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 05:12:09,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:09,832 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 05:12:09,982 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:12:09,982 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 05:12:09,988 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 05:12:10,013 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 05:12:10,022 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 05:12:10,114 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 05:12:10,119 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 05:12:10,826 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:12:10,826 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 05:12:10,833 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 05:12:10,966 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:12:10,967 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 05:12:10,973 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 05:12:11,064 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:12:11,064 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 05:12:11,075 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 05:12:11,088 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 05:12:11,095 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 05:12:11,125 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 05:12:11,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:12:11,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2023-11-29 05:12:11,325 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6325 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 05:12:11,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6322) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6323))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6322) .cse2 v_ArrVal_6324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 05:12:11,416 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6323))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6322) .cse1 v_ArrVal_6324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6322) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 05:12:13,851 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6416))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6323))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6417) .cse0 v_ArrVal_6322) .cse1 v_ArrVal_6324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6325) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6416))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6417) .cse6 v_ArrVal_6322) (select (select (store .cse7 .cse6 v_ArrVal_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6324))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 05:12:13,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:13,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061260192] [2023-11-29 05:12:13,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061260192] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:12:13,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1364614020] [2023-11-29 05:12:13,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:13,870 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:12:13,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:12:13,877 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:12:13,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 05:12:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:44,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 05:12:44,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:44,510 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 05:12:45,076 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:12:45,076 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 05:12:45,092 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 05:12:45,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:12:45,202 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 05:12:45,491 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 05:12:45,498 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 05:12:46,614 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:12:46,615 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 05:12:46,628 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 05:12:46,907 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:12:46,907 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 05:12:46,921 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 05:12:47,107 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:12:47,108 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 05:12:47,115 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 05:12:47,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 05:12:47,159 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 05:12:47,165 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 05:12:47,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:12:47,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6905 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6904) |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 05:12:47,288 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6905 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 05:12:47,343 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6902) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6903))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6902) .cse2 v_ArrVal_6904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 05:12:47,432 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6902) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6903))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6902) .cse3 v_ArrVal_6904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 05:12:49,095 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6905 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6997))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6903))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6996) .cse0 v_ArrVal_6902) .cse1 v_ArrVal_6904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6905) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6903 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6997 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6997))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6996) .cse6 v_ArrVal_6902) (select (select (store .cse7 .cse6 v_ArrVal_6903) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6904))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 05:12:49,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1364614020] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:12:49,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:12:49,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 05:12:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254932456] [2023-11-29 05:12:49,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:12:49,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:12:49,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:49,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:12:49,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 05:12:49,109 INFO L87 Difference]: Start difference. First operand 877 states and 938 transitions. Second operand has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 05:13:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:07,256 INFO L93 Difference]: Finished difference Result 1048 states and 1124 transitions. [2023-11-29 05:13:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:13:07,258 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 113 [2023-11-29 05:13:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:07,259 INFO L225 Difference]: With dead ends: 1048 [2023-11-29 05:13:07,260 INFO L226 Difference]: Without dead ends: 1048 [2023-11-29 05:13:07,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 05:13:07,260 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 466 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 5086 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 5094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:07,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 2968 Invalid, 5094 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 5086 Invalid, 0 Unknown, 0 Unchecked, 17.6s Time] [2023-11-29 05:13:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2023-11-29 05:13:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 876. [2023-11-29 05:13:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 557 states have (on average 1.6696588868940754) internal successors, (930), 870 states have internal predecessors, (930), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:13:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 937 transitions. [2023-11-29 05:13:07,271 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 937 transitions. Word has length 113 [2023-11-29 05:13:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:07,271 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 937 transitions. [2023-11-29 05:13:07,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 05:13:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 937 transitions. [2023-11-29 05:13:07,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 05:13:07,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:07,272 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] [2023-11-29 05:13:07,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 05:13:07,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 05:13:07,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:07,673 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:13:07,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash -575932888, now seen corresponding path program 1 times [2023-11-29 05:13:07,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:13:07,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229095403] [2023-11-29 05:13:07,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:07,675 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 05:13:07,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:13:07,675 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:07,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-11-29 05:13:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:08,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 05:13:08,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:13:08,657 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 05:13:08,914 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:13:08,914 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 05:13:08,969 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 05:13:09,140 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 05:13:10,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:13:10,489 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 05:13:10,660 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:13:10,660 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 05:13:10,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:13:10,811 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 05:13:10,831 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 05:13:10,899 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 05:13:10,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:13:11,004 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7437 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7437) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2023-11-29 05:13:11,023 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7437 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7437) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 05:13:11,046 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7437 (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$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7436))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7437)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:13:11,068 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7437 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7436))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7437)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:13:11,646 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7437 (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$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7483))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7436)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7437)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:13:11,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:13:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229095403] [2023-11-29 05:13:11,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229095403] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:13:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [286032088] [2023-11-29 05:13:11,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:11,651 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:13:11,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:13:11,652 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:13:11,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 05:13:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:39,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 05:13:39,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:13:39,448 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 05:13:40,048 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:13:40,048 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 05:13:40,153 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 05:13:40,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 20 treesize of output 12 [2023-11-29 05:13:41,738 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:13:41,739 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 05:13:42,033 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:13:42,034 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 05:13:42,208 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:13:42,208 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 05:13:42,236 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 05:13:42,251 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 05:13:42,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:13:46,385 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7923 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7923) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:13:46,408 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7923 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7922 (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$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7922))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7923)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:13:46,430 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7923 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7922 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7922))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7923)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:13:47,012 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7923 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7922 (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$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7969))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7922)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7923)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:13:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [286032088] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:13:47,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:13:47,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 05:13:47,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107361662] [2023-11-29 05:13:47,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:13:47,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:13:47,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:13:47,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:13:47,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=308, Unknown=11, NotChecked=396, Total=812 [2023-11-29 05:13:47,020 INFO L87 Difference]: Start difference. First operand 876 states and 937 transitions. Second operand has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 05:14:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:14:00,088 INFO L93 Difference]: Finished difference Result 1047 states and 1123 transitions. [2023-11-29 05:14:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:14:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 113 [2023-11-29 05:14:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:14:00,092 INFO L225 Difference]: With dead ends: 1047 [2023-11-29 05:14:00,092 INFO L226 Difference]: Without dead ends: 1047 [2023-11-29 05:14:00,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=106, Invalid=339, Unknown=11, NotChecked=414, Total=870 [2023-11-29 05:14:00,093 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 860 mSDsluCounter, 2743 mSDsCounter, 0 mSdLazyCounter, 3414 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 3424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:14:00,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 3178 Invalid, 3424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 3414 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2023-11-29 05:14:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2023-11-29 05:14:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 875. [2023-11-29 05:14:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 557 states have (on average 1.6678635547576302) internal successors, (929), 869 states have internal predecessors, (929), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:14:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 936 transitions. [2023-11-29 05:14:00,114 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 936 transitions. Word has length 113 [2023-11-29 05:14:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:14:00,114 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 936 transitions. [2023-11-29 05:14:00,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 05:14:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 936 transitions. [2023-11-29 05:14:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 05:14:00,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:14:00,115 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, 1] [2023-11-29 05:14:00,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2023-11-29 05:14:00,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-11-29 05:14:00,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:14:00,516 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:14:00,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:14:00,516 INFO L85 PathProgramCache]: Analyzing trace with hash 580616723, now seen corresponding path program 1 times [2023-11-29 05:14:00,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:14:00,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383018040] [2023-11-29 05:14:00,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:14:00,517 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 05:14:00,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:14:00,518 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:14:00,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-11-29 05:14:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:14:01,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 05:14:01,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:14:01,639 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 05:14:01,893 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:14:01,893 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 05:14:01,937 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 05:14:02,093 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 05:14:03,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:14:03,481 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 05:14:03,666 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:14:03,667 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 05:14:03,818 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:14:03,818 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 05:14:03,972 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:14:03,973 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 05:14:04,005 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 05:14:04,075 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 05:14:04,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:14:04,182 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8425 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8425) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:14:04,201 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8425 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8425) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 05:14:04,222 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8424 (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$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8424))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8425)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:14:04,243 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8424 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8424))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8425)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:14:04,268 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8423 (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$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8423))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8424)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8425)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:14:04,293 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8423 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8423))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8424)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8425)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:14:04,847 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8423 (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$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8471))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8423)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8424)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8425)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:14:04,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:14:04,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383018040] [2023-11-29 05:14:04,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383018040] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:14:04,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [767800723] [2023-11-29 05:14:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:14:04,855 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:14:04,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:14:04,856 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:14:04,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-11-29 05:14:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:14:40,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 05:14:40,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:14:40,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 05:14:41,436 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:14:41,437 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 05:14:41,558 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 05:14:41,831 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 05:14:43,089 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:14:43,090 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 05:14:43,379 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:14:43,379 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 05:14:43,551 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:14:43,551 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 05:14:43,738 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:14:43,738 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 05:14:43,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 05:14:43,774 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 05:14:43,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:14:44,709 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8927) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 05:14:44,731 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8926 (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$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8926))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8927)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:14:44,753 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8926))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8927)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:14:44,778 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8925 (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$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8925))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8926)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8927)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:14:44,805 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8925 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8925))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8926)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8927)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:14:45,389 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8973 (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$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8973))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8925)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8926)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8927)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:14:45,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [767800723] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:14:45,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:14:45,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 05:14:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001557138] [2023-11-29 05:14:45,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:14:45,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 05:14:45,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:14:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:14:45,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=380, Unknown=15, NotChecked=676, Total=1190 [2023-11-29 05:14:45,398 INFO L87 Difference]: Start difference. First operand 875 states and 936 transitions. Second operand has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 05:14:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:14:57,616 INFO L93 Difference]: Finished difference Result 1046 states and 1122 transitions. [2023-11-29 05:14:57,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:14:57,618 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 115 [2023-11-29 05:14:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:14:57,620 INFO L225 Difference]: With dead ends: 1046 [2023-11-29 05:14:57,620 INFO L226 Difference]: Without dead ends: 1046 [2023-11-29 05:14:57,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=128, Invalid=415, Unknown=15, NotChecked=702, Total=1260 [2023-11-29 05:14:57,621 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 455 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 3459 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 3465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:14:57,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 3132 Invalid, 3465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3459 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2023-11-29 05:14:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2023-11-29 05:14:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 874. [2023-11-29 05:14:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 557 states have (on average 1.666068222621185) internal successors, (928), 868 states have internal predecessors, (928), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:14:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 935 transitions. [2023-11-29 05:14:57,632 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 935 transitions. Word has length 115 [2023-11-29 05:14:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:14:57,632 INFO L495 AbstractCegarLoop]: Abstraction has 874 states and 935 transitions. [2023-11-29 05:14:57,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 05:14:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 935 transitions. [2023-11-29 05:14:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 05:14:57,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:14:57,633 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, 1] [2023-11-29 05:14:57,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2023-11-29 05:14:57,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2023-11-29 05:14:58,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:14:58,033 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:14:58,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:14:58,034 INFO L85 PathProgramCache]: Analyzing trace with hash 580616724, now seen corresponding path program 1 times [2023-11-29 05:14:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:14:58,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264287967] [2023-11-29 05:14:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:14:58,035 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 05:14:58,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:14:58,036 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:14:58,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-11-29 05:14:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:14:59,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 05:14:59,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:14:59,316 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 05:14:59,538 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 05:14:59,563 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:14:59,563 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 05:14:59,607 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 05:14:59,615 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 05:14:59,795 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 05:14:59,801 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 05:15:00,902 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:15:00,902 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 05:15:00,911 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 05:15:01,097 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:15:01,097 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 05:15:01,112 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 05:15:01,263 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:15:01,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 05:15:01,283 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 05:15:01,431 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:15:01,431 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 05:15:01,446 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 05:15:01,471 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 05:15:01,481 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 05:15:01,533 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 05:15:01,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:15:01,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 05:15:01,822 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 05:15:01,965 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9476))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9475) .cse0 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9475) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9477) |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 05:15:02,079 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9475) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9476))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9475) .cse3 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 05:15:03,087 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9473))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9474) .cse1 v_ArrVal_9475) (select (select (store .cse2 .cse1 v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9477))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9473))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9476))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9474) .cse4 v_ArrVal_9475) .cse5 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 05:15:16,863 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9569 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9570))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9473))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9569) .cse1 v_ArrVal_9474) .cse2 v_ArrVal_9475) (select (select (store .cse3 .cse2 v_ArrVal_9476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9477))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9475 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9474 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9569 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9476 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9570))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9473))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9476))) (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$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9569) .cse6 v_ArrVal_9474) .cse7 v_ArrVal_9475) .cse8 v_ArrVal_9477) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 05:15:16,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:15:16,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264287967] [2023-11-29 05:15:16,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264287967] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:15:16,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [33606805] [2023-11-29 05:15:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:15:16,904 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:15:16,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:15:16,905 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:15:16,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2023-11-29 05:15:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:57,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 05:15:57,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:15:58,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:16:01,099 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:16:01,100 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 05:16:01,156 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 05:16:01,715 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 05:16:01,826 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 05:16:03,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 05:16:03,194 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 05:16:08,524 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:16:08,525 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 05:16:08,609 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 05:16:09,911 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:16:09,912 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 05:16:09,998 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 05:16:10,833 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:16:10,833 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 05:16:10,889 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 05:16:11,820 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:16:11,820 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 05:16:11,850 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 05:16:11,964 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 05:16:12,021 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 05:16:12,051 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 05:16:12,051 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:16:12,305 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:16:12,436 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_10075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_10075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 05:16:12,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_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10072))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10073) .cse0 v_ArrVal_10075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10073) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10075) |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 05:16:12,900 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_10073) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_10072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_10072))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_10073) .cse3 v_ArrVal_10075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 05:16:19,460 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_10070))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10072))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_10071) .cse1 v_ArrVal_10073) .cse2 v_ArrVal_10075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_10070))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_10071) .cse7 v_ArrVal_10073) (select (select (store .cse8 .cse7 v_ArrVal_10072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10075))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 05:16:27,832 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10167))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10070))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10072))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10166) .cse0 v_ArrVal_10071) .cse1 v_ArrVal_10073) .cse2 v_ArrVal_10075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10071 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10167))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10070))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10166) .cse8 v_ArrVal_10071) .cse9 v_ArrVal_10073) (select (select (store .cse10 .cse9 v_ArrVal_10072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10075))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 05:16:27,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [33606805] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:27,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:16:27,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 05:16:27,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566640562] [2023-11-29 05:16:27,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:16:27,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 05:16:27,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:16:27,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:16:27,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=414, Unknown=30, NotChecked=636, Total=1190 [2023-11-29 05:16:27,877 INFO L87 Difference]: Start difference. First operand 874 states and 935 transitions. Second operand has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 05:17:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:32,361 INFO L93 Difference]: Finished difference Result 1045 states and 1121 transitions. [2023-11-29 05:17:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:17:32,363 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 115 [2023-11-29 05:17:32,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:32,365 INFO L225 Difference]: With dead ends: 1045 [2023-11-29 05:17:32,365 INFO L226 Difference]: Without dead ends: 1045 [2023-11-29 05:17:32,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=180, Invalid=706, Unknown=32, NotChecked=804, Total=1722 [2023-11-29 05:17:32,366 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 462 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 3627 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 3636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:32,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 2254 Invalid, 3636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3627 Invalid, 0 Unknown, 0 Unchecked, 57.8s Time] [2023-11-29 05:17:32,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2023-11-29 05:17:32,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 873. [2023-11-29 05:17:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 557 states have (on average 1.6642728904847397) internal successors, (927), 867 states have internal predecessors, (927), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:17:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 934 transitions. [2023-11-29 05:17:32,379 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 934 transitions. Word has length 115 [2023-11-29 05:17:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:32,380 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 934 transitions. [2023-11-29 05:17:32,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 05:17:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 934 transitions. [2023-11-29 05:17:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 05:17:32,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:32,381 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, 1, 1, 1] [2023-11-29 05:17:32,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2023-11-29 05:17:32,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2023-11-29 05:17:32,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:17:32,782 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:17:32,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -371698694, now seen corresponding path program 1 times [2023-11-29 05:17:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:17:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094161633] [2023-11-29 05:17:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:32,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:17:32,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:17:32,785 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:17:32,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-11-29 05:17:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:34,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 05:17:34,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:34,656 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 05:17:36,401 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:17:36,401 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 05:17:36,665 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 05:17:37,468 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 05:17:44,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:17:44,516 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 05:17:45,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:17:45,504 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 05:17:46,220 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:17:46,220 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 05:17:46,930 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:17:46,931 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 05:17:47,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:17:47,700 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 05:17:47,827 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 05:17:48,372 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 05:17:48,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 05:17:48,762 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 05:17:48,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:17:49,656 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10641) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 05:17:49,792 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10641) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))) is different from false [2023-11-29 05:17:49,905 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10640))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10641)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 05:17:50,020 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10641)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 05:17:50,137 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10639))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10641)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 05:17:50,260 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10639))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10641)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 05:17:50,381 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (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$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10638))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10639)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10641)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 05:17:50,510 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10638))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10639)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10641)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 05:17:52,526 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_10640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10688))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10638)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10639)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10640)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10641)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 05:17:52,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:17:52,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094161633] [2023-11-29 05:17:52,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094161633] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:52,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1778527530] [2023-11-29 05:17:52,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:52,548 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:17:52,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:17:52,549 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:17:52,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2023-11-29 05:17:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:57,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 05:17:57,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:57,331 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 05:18:00,837 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:18:00,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 05:18:01,558 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 05:18:02,989 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 05:18:11,943 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:18:11,944 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 05:18:13,500 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:18:13,501 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 05:18:14,450 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:18:14,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:18:15,482 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:18:15,482 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 05:18:16,542 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:18:16,543 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 05:18:16,638 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 05:18:17,188 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 05:18:17,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 05:18:17,277 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 05:18:17,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:17,825 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11163) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 05:18:17,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_11163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-29 05:18:18,082 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11162))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11163)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 05:18:18,195 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11162))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11163)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 05:18:18,313 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11161))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11162)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11163)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 05:18:18,432 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11161))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11162)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11163)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 05:18:18,555 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_11160 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (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$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11160))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11161)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11162)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11163)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 05:18:18,683 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10642 (_ BitVec 1)) (v_ArrVal_11161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11162 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_11160 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10642) (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11160))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11161)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11162)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11163)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 05:18:21,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1778527530] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:21,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:18:21,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 05:18:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95544059] [2023-11-29 05:18:21,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:21,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 05:18:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:18:21,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 05:18:21,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=554, Unknown=17, NotChecked=1088, Total=1806 [2023-11-29 05:18:21,349 INFO L87 Difference]: Start difference. First operand 873 states and 934 transitions. Second operand has 23 states, 20 states have (on average 7.05) internal successors, (141), 23 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:19:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:12,682 INFO L93 Difference]: Finished difference Result 1044 states and 1120 transitions. [2023-11-29 05:19:12,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:19:12,684 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.05) internal successors, (141), 23 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 117 [2023-11-29 05:19:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:12,686 INFO L225 Difference]: With dead ends: 1044 [2023-11-29 05:19:12,686 INFO L226 Difference]: Without dead ends: 1044 [2023-11-29 05:19:12,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=156, Invalid=597, Unknown=17, NotChecked=1122, Total=1892 [2023-11-29 05:19:12,687 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 846 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 3202 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 2862 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:12,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 2862 Invalid, 3214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3202 Invalid, 0 Unknown, 0 Unchecked, 50.8s Time] [2023-11-29 05:19:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2023-11-29 05:19:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 872. [2023-11-29 05:19:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 557 states have (on average 1.6624775583482945) internal successors, (926), 866 states have internal predecessors, (926), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 05:19:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 933 transitions. [2023-11-29 05:19:12,700 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 933 transitions. Word has length 117 [2023-11-29 05:19:12,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:12,700 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 933 transitions. [2023-11-29 05:19:12,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.05) internal successors, (141), 23 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:19:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 933 transitions. [2023-11-29 05:19:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 05:19:12,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:12,701 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, 1, 1, 1] [2023-11-29 05:19:12,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (47)] Ended with exit code 0 [2023-11-29 05:19:12,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2023-11-29 05:19:13,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:19:13,102 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:19:13,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash -371698693, now seen corresponding path program 1 times [2023-11-29 05:19:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:19:13,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762691519] [2023-11-29 05:19:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:13,103 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 05:19:13,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:19:13,104 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:19:13,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4d2e6ae-f340-4b48-bfef-0bea137d9084/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-11-29 05:19:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:14,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-29 05:19:14,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:14,692 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 05:19:16,159 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 05:19:16,497 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:19:16,497 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 05:19:16,899 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 05:19:16,990 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 05:19:18,110 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 35 treesize of output 17 [2023-11-29 05:19:18,142 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 05:19:28,928 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:19:28,928 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 75 treesize of output 68 [2023-11-29 05:19:29,049 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 05:19:30,054 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:19:30,054 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 75 treesize of output 68 [2023-11-29 05:19:30,180 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 05:19:30,994 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:19:30,995 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 75 treesize of output 68 [2023-11-29 05:19:31,028 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