./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/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_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/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_8419e781-515f-4476-8313-3e88972b1c27/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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:05:13,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:05:13,989 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 01:05:13,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:05:13,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:05:14,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:05:14,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:05:14,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:05:14,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:05:14,020 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:05:14,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:05:14,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:05:14,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:05:14,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:05:14,023 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:05:14,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:05:14,024 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:05:14,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:05:14,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:05:14,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:05:14,026 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:05:14,026 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:05:14,027 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:05:14,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:05:14,028 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:05:14,028 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:05:14,028 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:05:14,029 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:05:14,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:05:14,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:05:14,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:05:14,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:05:14,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:05:14,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:05:14,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:05:14,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:05:14,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:05:14,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:05:14,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:05:14,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:05:14,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:05:14,032 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_8419e781-515f-4476-8313-3e88972b1c27/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_8419e781-515f-4476-8313-3e88972b1c27/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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2023-11-29 01:05:14,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:05:14,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:05:14,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:05:14,280 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:05:14,281 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:05:14,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2023-11-29 01:05:17,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:05:17,297 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:05:17,298 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2023-11-29 01:05:17,316 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/data/755b25667/0e0b9fcae5994c33800cf21607098eae/FLAGc71ef3409 [2023-11-29 01:05:17,331 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/data/755b25667/0e0b9fcae5994c33800cf21607098eae [2023-11-29 01:05:17,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:05:17,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:05:17,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:05:17,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:05:17,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:05:17,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:05:17" (1/1) ... [2023-11-29 01:05:17,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679638a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:17, skipping insertion in model container [2023-11-29 01:05:17,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:05:17" (1/1) ... [2023-11-29 01:05:17,403 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:05:17,901 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:05:17,913 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 01:05:17,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7c8bb753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:17, skipping insertion in model container [2023-11-29 01:05:17,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:05:17,914 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 01:05:17,916 INFO L158 Benchmark]: Toolchain (without parser) took 579.94ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 74.4MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 01:05:17,917 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory was 114.6MB in the beginning and 114.4MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:05:17,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.82ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 74.4MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 01:05:17,920 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.20ms. Allocated memory is still 142.6MB. Free memory was 114.6MB in the beginning and 114.4MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.82ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 74.4MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 739]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/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_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/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_8419e781-515f-4476-8313-3e88972b1c27/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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:05:19,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:05:19,787 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 01:05:19,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:05:19,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:05:19,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:05:19,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:05:19,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:05:19,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:05:19,834 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:05:19,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:05:19,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:05:19,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:05:19,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:05:19,837 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:05:19,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:05:19,838 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:05:19,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:05:19,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:05:19,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:05:19,841 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:05:19,841 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:05:19,842 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:05:19,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:05:19,843 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:05:19,843 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:05:19,844 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:05:19,844 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:05:19,844 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:05:19,845 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:05:19,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:05:19,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:05:19,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:05:19,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:05:19,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:05:19,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:05:19,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:05:19,847 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:05:19,847 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:05:19,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:05:19,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:05:19,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:05:19,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:05:19,849 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:05:19,849 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_8419e781-515f-4476-8313-3e88972b1c27/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_8419e781-515f-4476-8313-3e88972b1c27/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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2023-11-29 01:05:20,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:05:20,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:05:20,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:05:20,158 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:05:20,159 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:05:20,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2023-11-29 01:05:22,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:05:23,291 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:05:23,291 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2023-11-29 01:05:23,309 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/data/4a5baab9a/8b360920212b457fa1b538ffe6a9eaac/FLAG96d7ea952 [2023-11-29 01:05:23,324 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/data/4a5baab9a/8b360920212b457fa1b538ffe6a9eaac [2023-11-29 01:05:23,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:05:23,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:05:23,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:05:23,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:05:23,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:05:23,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:05:23" (1/1) ... [2023-11-29 01:05:23,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703479a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:23, skipping insertion in model container [2023-11-29 01:05:23,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:05:23" (1/1) ... [2023-11-29 01:05:23,416 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:05:23,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:05:23,944 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 01:05:23,958 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:05:24,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:05:24,040 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:05:24,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:05:24,165 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:05:24,173 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:05:24,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24 WrapperNode [2023-11-29 01:05:24,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:05:24,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:05:24,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:05:24,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:05:24,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,286 INFO L138 Inliner]: procedures = 180, calls = 333, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1198 [2023-11-29 01:05:24,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:05:24,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:05:24,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:05:24,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:05:24,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,431 INFO L175 MemorySlicer]: Split 307 memory accesses to 4 slices as follows [2, 34, 5, 266]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 4, 1, 58]. [2023-11-29 01:05:24,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:05:24,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:05:24,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:05:24,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:05:24,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (1/1) ... [2023-11-29 01:05:24,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:05:24,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:05:24,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:05:24,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:05:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 01:05:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 01:05:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 01:05:24,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 01:05:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 01:05:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 01:05:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 01:05:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 01:05:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 01:05:24,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 01:05:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 01:05:24,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 01:05:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 01:05:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 01:05:24,587 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 01:05:24,587 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 01:05:24,587 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 01:05:24,587 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 01:05:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:05:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:05:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:05:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:05:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:05:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 01:05:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:05:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 01:05:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:05:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:05:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:05:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 01:05:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 01:05:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 01:05:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 01:05:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 01:05:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:05:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:05:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:05:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 01:05:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 01:05:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:05:24,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:05:24,820 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:05:24,822 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:05:24,825 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:05:24,873 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:05:24,896 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:05:24,917 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:05:30,175 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:05:30,381 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:05:30,381 INFO L309 CfgBuilder]: Removed 72 assume(true) statements. [2023-11-29 01:05:30,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:05:30 BoogieIcfgContainer [2023-11-29 01:05:30,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:05:30,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:05:30,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:05:30,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:05:30,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:05:23" (1/3) ... [2023-11-29 01:05:30,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16da655e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:05:30, skipping insertion in model container [2023-11-29 01:05:30,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:05:24" (2/3) ... [2023-11-29 01:05:30,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16da655e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:05:30, skipping insertion in model container [2023-11-29 01:05:30,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:05:30" (3/3) ... [2023-11-29 01:05:30,392 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test3-2.i [2023-11-29 01:05:30,413 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:05:30,413 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 636 error locations. [2023-11-29 01:05:30,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:05:30,489 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;@2eaa4b03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:05:30,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 636 error locations. [2023-11-29 01:05:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 1147 states, 506 states have (on average 2.5375494071146245) internal successors, (1284), 1140 states have internal predecessors, (1284), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:05:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 01:05:30,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:30,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 01:05:30,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr634ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:05:30,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:30,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1985795, now seen corresponding path program 1 times [2023-11-29 01:05:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:30,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840802605] [2023-11-29 01:05:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:30,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 01:05:30,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:30,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:30,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:30,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:05:30,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:30,822 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 01:05:30,824 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 01:05:30,824 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:05:30,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:05:30,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840802605] [2023-11-29 01:05:30,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840802605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:05:30,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:05:30,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:05:30,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697987354] [2023-11-29 01:05:30,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:05:30,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:05:30,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:05:30,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:05:30,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 01:05:30,862 INFO L87 Difference]: Start difference. First operand has 1147 states, 506 states have (on average 2.5375494071146245) internal successors, (1284), 1140 states have internal predecessors, (1284), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 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 01:05:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:05:34,545 INFO L93 Difference]: Finished difference Result 1671 states and 1783 transitions. [2023-11-29 01:05:34,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:05:34,547 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 01:05:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:05:34,571 INFO L225 Difference]: With dead ends: 1671 [2023-11-29 01:05:34,571 INFO L226 Difference]: Without dead ends: 1669 [2023-11-29 01:05:34,572 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 01:05:34,575 INFO L413 NwaCegarLoop]: 862 mSDtfsCounter, 570 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1784 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:05:34,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1423 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1008 Invalid, 0 Unknown, 1784 Unchecked, 3.5s Time] [2023-11-29 01:05:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2023-11-29 01:05:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1136. [2023-11-29 01:05:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 501 states have (on average 2.3832335329341316) internal successors, (1194), 1129 states have internal predecessors, (1194), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:05:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1204 transitions. [2023-11-29 01:05:34,676 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1204 transitions. Word has length 3 [2023-11-29 01:05:34,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:05:34,676 INFO L495 AbstractCegarLoop]: Abstraction has 1136 states and 1204 transitions. [2023-11-29 01:05:34,676 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 01:05:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1204 transitions. [2023-11-29 01:05:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 01:05:34,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:34,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 01:05:34,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:34,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:34,878 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:05:34,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:34,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1983921, now seen corresponding path program 1 times [2023-11-29 01:05:34,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:34,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469644636] [2023-11-29 01:05:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:34,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:34,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:34,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:34,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:34,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:05:34,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:35,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 01:05:35,028 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 01:05:35,028 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:05:35,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:05:35,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469644636] [2023-11-29 01:05:35,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469644636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:05:35,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:05:35,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:05:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250645684] [2023-11-29 01:05:35,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:05:35,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:05:35,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:05:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:05:35,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:05:35,032 INFO L87 Difference]: Start difference. First operand 1136 states and 1204 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 01:05:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:05:37,189 INFO L93 Difference]: Finished difference Result 1310 states and 1387 transitions. [2023-11-29 01:05:37,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:05:37,190 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 01:05:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:05:37,195 INFO L225 Difference]: With dead ends: 1310 [2023-11-29 01:05:37,195 INFO L226 Difference]: Without dead ends: 1310 [2023-11-29 01:05:37,196 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 01:05:37,197 INFO L413 NwaCegarLoop]: 629 mSDtfsCounter, 1066 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:05:37,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 767 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 01:05:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2023-11-29 01:05:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1136. [2023-11-29 01:05:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 510 states have (on average 2.3450980392156864) internal successors, (1196), 1128 states have internal predecessors, (1196), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:05:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1206 transitions. [2023-11-29 01:05:37,220 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1206 transitions. Word has length 3 [2023-11-29 01:05:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:05:37,221 INFO L495 AbstractCegarLoop]: Abstraction has 1136 states and 1206 transitions. [2023-11-29 01:05:37,221 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 01:05:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1206 transitions. [2023-11-29 01:05:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 01:05:37,221 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:37,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 01:05:37,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:37,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:37,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:05:37,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1983922, now seen corresponding path program 1 times [2023-11-29 01:05:37,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:37,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480026314] [2023-11-29 01:05:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:37,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:37,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:37,425 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:37,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:37,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:05:37,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:37,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:05:37,551 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 01:05:37,551 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:05:37,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:05:37,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480026314] [2023-11-29 01:05:37,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480026314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:05:37,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:05:37,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:05:37,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951672429] [2023-11-29 01:05:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:05:37,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:05:37,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:05:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:05:37,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:05:37,554 INFO L87 Difference]: Start difference. First operand 1136 states and 1206 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 01:05:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:05:41,673 INFO L93 Difference]: Finished difference Result 1683 states and 1797 transitions. [2023-11-29 01:05:41,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:05:41,673 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 01:05:41,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:05:41,681 INFO L225 Difference]: With dead ends: 1683 [2023-11-29 01:05:41,681 INFO L226 Difference]: Without dead ends: 1683 [2023-11-29 01:05:41,681 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 01:05:41,682 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 586 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:05:41,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1422 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 01:05:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2023-11-29 01:05:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1307. [2023-11-29 01:05:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 681 states have (on average 2.317180616740088) internal successors, (1578), 1298 states have internal predecessors, (1578), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:05:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1590 transitions. [2023-11-29 01:05:41,711 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1590 transitions. Word has length 3 [2023-11-29 01:05:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:05:41,711 INFO L495 AbstractCegarLoop]: Abstraction has 1307 states and 1590 transitions. [2023-11-29 01:05:41,712 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 01:05:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1590 transitions. [2023-11-29 01:05:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 01:05:41,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:41,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:05:41,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:41,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:41,914 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:05:41,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1757706757, now seen corresponding path program 1 times [2023-11-29 01:05:41,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:41,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834101054] [2023-11-29 01:05:41,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:41,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:41,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:41,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:41,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:42,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:05:42,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:42,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:05:42,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:05:42,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:05:42,176 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 01:05:42,199 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:05:42,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:05:42,225 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 01:05:42,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:05:42,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:05:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834101054] [2023-11-29 01:05:42,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834101054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:05:42,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:05:42,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:05:42,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207801753] [2023-11-29 01:05:42,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:05:42,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:05:42,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:05:42,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:05:42,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:05:42,227 INFO L87 Difference]: Start difference. First operand 1307 states and 1590 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 01:05:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:05:45,984 INFO L93 Difference]: Finished difference Result 1474 states and 1767 transitions. [2023-11-29 01:05:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:05:45,985 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 01:05:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:05:45,990 INFO L225 Difference]: With dead ends: 1474 [2023-11-29 01:05:45,990 INFO L226 Difference]: Without dead ends: 1474 [2023-11-29 01:05:45,991 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 01:05:45,991 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1338 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:05:45,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 393 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 01:05:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2023-11-29 01:05:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1125. [2023-11-29 01:05:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 510 states have (on average 2.319607843137255) internal successors, (1183), 1117 states have internal predecessors, (1183), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:05:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1193 transitions. [2023-11-29 01:05:46,015 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1193 transitions. Word has length 7 [2023-11-29 01:05:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:05:46,015 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1193 transitions. [2023-11-29 01:05:46,015 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 01:05:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1193 transitions. [2023-11-29 01:05:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 01:05:46,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:46,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:05:46,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 01:05:46,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:46,219 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:05:46,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1345665387, now seen corresponding path program 1 times [2023-11-29 01:05:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236447815] [2023-11-29 01:05:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:46,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:46,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:46,221 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:46,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:46,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:05:46,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:46,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:05:46,382 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 01:05:46,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:05:46,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:05:46,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236447815] [2023-11-29 01:05:46,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236447815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:05:46,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:05:46,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:05:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662602915] [2023-11-29 01:05:46,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:05:46,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:05:46,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:05:46,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:05:46,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:05:46,385 INFO L87 Difference]: Start difference. First operand 1125 states and 1193 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 01:05:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:05:48,832 INFO L93 Difference]: Finished difference Result 1422 states and 1521 transitions. [2023-11-29 01:05:48,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:05:48,834 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 01:05:48,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:05:48,840 INFO L225 Difference]: With dead ends: 1422 [2023-11-29 01:05:48,840 INFO L226 Difference]: Without dead ends: 1422 [2023-11-29 01:05:48,840 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 01:05:48,841 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 885 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:05:48,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1251 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 01:05:48,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2023-11-29 01:05:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1077. [2023-11-29 01:05:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 510 states have (on average 2.2254901960784315) internal successors, (1135), 1069 states have internal predecessors, (1135), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:05:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1145 transitions. [2023-11-29 01:05:48,861 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1145 transitions. Word has length 8 [2023-11-29 01:05:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:05:48,861 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1145 transitions. [2023-11-29 01:05:48,861 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 01:05:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1145 transitions. [2023-11-29 01:05:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 01:05:48,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:48,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:05:48,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:49,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:49,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:05:49,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1345665388, now seen corresponding path program 1 times [2023-11-29 01:05:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:49,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024586275] [2023-11-29 01:05:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:49,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:49,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:49,066 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:49,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:49,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:05:49,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:49,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:05:49,212 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 01:05:49,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:05:49,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:05:49,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024586275] [2023-11-29 01:05:49,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024586275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:05:49,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:05:49,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:05:49,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616698193] [2023-11-29 01:05:49,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:05:49,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:05:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:05:49,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:05:49,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:05:49,214 INFO L87 Difference]: Start difference. First operand 1077 states and 1145 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 01:05:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:05:53,030 INFO L93 Difference]: Finished difference Result 1491 states and 1593 transitions. [2023-11-29 01:05:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:05:53,031 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 01:05:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:05:53,038 INFO L225 Difference]: With dead ends: 1491 [2023-11-29 01:05:53,038 INFO L226 Difference]: Without dead ends: 1491 [2023-11-29 01:05:53,038 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 01:05:53,039 INFO L413 NwaCegarLoop]: 1121 mSDtfsCounter, 613 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:05:53,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1557 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 01:05:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2023-11-29 01:05:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1090. [2023-11-29 01:05:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 533 states have (on average 2.217636022514071) internal successors, (1182), 1082 states have internal predecessors, (1182), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 01:05:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1192 transitions. [2023-11-29 01:05:53,064 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1192 transitions. Word has length 8 [2023-11-29 01:05:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:05:53,065 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1192 transitions. [2023-11-29 01:05:53,065 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 01:05:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1192 transitions. [2023-11-29 01:05:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 01:05:53,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:53,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:05:53,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:53,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:53,266 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:05:53,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1244806716, now seen corresponding path program 1 times [2023-11-29 01:05:53,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:53,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048269767] [2023-11-29 01:05:53,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:53,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:53,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:53,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:53,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:53,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:05:53,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:05:53,487 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:05:53,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:05:53,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048269767] [2023-11-29 01:05:53,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048269767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:05:53,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:05:53,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:05:53,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601621240] [2023-11-29 01:05:53,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:05:53,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:05:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:05:53,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:05:53,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:05:53,490 INFO L87 Difference]: Start difference. First operand 1090 states and 1192 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 01:05:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:05:55,782 INFO L93 Difference]: Finished difference Result 1680 states and 1827 transitions. [2023-11-29 01:05:55,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:05:55,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 01:05:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:05:55,791 INFO L225 Difference]: With dead ends: 1680 [2023-11-29 01:05:55,791 INFO L226 Difference]: Without dead ends: 1680 [2023-11-29 01:05:55,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 01:05:55,792 INFO L413 NwaCegarLoop]: 1102 mSDtfsCounter, 689 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 2945 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:05:55,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 2945 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 01:05:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2023-11-29 01:05:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1296. [2023-11-29 01:05:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 738 states have (on average 2.1707317073170733) internal successors, (1602), 1287 states have internal predecessors, (1602), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:05:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1614 transitions. [2023-11-29 01:05:55,815 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1614 transitions. Word has length 11 [2023-11-29 01:05:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:05:55,815 INFO L495 AbstractCegarLoop]: Abstraction has 1296 states and 1614 transitions. [2023-11-29 01:05:55,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 01:05:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1614 transitions. [2023-11-29 01:05:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:05:55,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:55,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:05:55,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:56,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:56,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:05:56,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1451564068, now seen corresponding path program 1 times [2023-11-29 01:05:56,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:56,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559594612] [2023-11-29 01:05:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:56,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:56,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:56,019 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:56,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:56,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:05:56,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:56,150 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 01:05:56,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:05:56,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:05:56,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559594612] [2023-11-29 01:05:56,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559594612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:05:56,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:05:56,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:05:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149047712] [2023-11-29 01:05:56,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:05:56,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:05:56,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:05:56,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:05:56,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:05:56,152 INFO L87 Difference]: Start difference. First operand 1296 states and 1614 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 01:05:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:05:57,061 INFO L93 Difference]: Finished difference Result 1242 states and 1534 transitions. [2023-11-29 01:05:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:05:57,063 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 01:05:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:05:57,067 INFO L225 Difference]: With dead ends: 1242 [2023-11-29 01:05:57,067 INFO L226 Difference]: Without dead ends: 1242 [2023-11-29 01:05:57,068 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 01:05:57,068 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 70 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:05:57,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1863 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:05:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2023-11-29 01:05:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1242. [2023-11-29 01:05:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 708 states have (on average 2.1497175141242937) internal successors, (1522), 1233 states have internal predecessors, (1522), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:05:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1534 transitions. [2023-11-29 01:05:57,095 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1534 transitions. Word has length 13 [2023-11-29 01:05:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:05:57,095 INFO L495 AbstractCegarLoop]: Abstraction has 1242 states and 1534 transitions. [2023-11-29 01:05:57,095 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 01:05:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1534 transitions. [2023-11-29 01:05:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 01:05:57,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:57,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:05:57,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:57,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:57,297 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:05:57,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash -911275618, now seen corresponding path program 1 times [2023-11-29 01:05:57,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:57,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794820609] [2023-11-29 01:05:57,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:57,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:57,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:57,299 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:57,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:57,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:05:57,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:57,434 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 01:05:57,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:05:57,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:05:57,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794820609] [2023-11-29 01:05:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794820609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:05:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:05:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:05:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478852449] [2023-11-29 01:05:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:05:57,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:05:57,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:05:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:05:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:05:57,436 INFO L87 Difference]: Start difference. First operand 1242 states and 1534 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 01:05:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:05:58,694 INFO L93 Difference]: Finished difference Result 1228 states and 1492 transitions. [2023-11-29 01:05:58,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:05:58,696 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 01:05:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:05:58,701 INFO L225 Difference]: With dead ends: 1228 [2023-11-29 01:05:58,701 INFO L226 Difference]: Without dead ends: 1228 [2023-11-29 01:05:58,701 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 01:05:58,702 INFO L413 NwaCegarLoop]: 925 mSDtfsCounter, 58 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:05:58,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2751 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 01:05:58,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2023-11-29 01:05:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1226. [2023-11-29 01:05:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 706 states have (on average 2.093484419263456) internal successors, (1478), 1217 states have internal predecessors, (1478), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:05:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1490 transitions. [2023-11-29 01:05:58,721 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1490 transitions. Word has length 15 [2023-11-29 01:05:58,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:05:58,721 INFO L495 AbstractCegarLoop]: Abstraction has 1226 states and 1490 transitions. [2023-11-29 01:05:58,721 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 01:05:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1490 transitions. [2023-11-29 01:05:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 01:05:58,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:58,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:05:58,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:58,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:58,923 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr634ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:05:58,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:58,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1831205617, now seen corresponding path program 1 times [2023-11-29 01:05:58,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:58,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143859508] [2023-11-29 01:05:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:58,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:58,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:58,925 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:58,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:05:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:59,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:05:59,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:59,272 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 01:05:59,273 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 01:05:59,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:05:59,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:05:59,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143859508] [2023-11-29 01:05:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143859508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:05:59,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:05:59,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:05:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899191780] [2023-11-29 01:05:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:05:59,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:05:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:05:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:05:59,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 01:05:59,275 INFO L87 Difference]: Start difference. First operand 1226 states and 1490 transitions. Second operand has 4 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 01:06:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:01,413 INFO L93 Difference]: Finished difference Result 1496 states and 1835 transitions. [2023-11-29 01:06:01,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:01,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 01:06:01,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:01,420 INFO L225 Difference]: With dead ends: 1496 [2023-11-29 01:06:01,420 INFO L226 Difference]: Without dead ends: 1488 [2023-11-29 01:06:01,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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 01:06:01,421 INFO L413 NwaCegarLoop]: 864 mSDtfsCounter, 226 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1300 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:01,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1386 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 1300 Unchecked, 2.1s Time] [2023-11-29 01:06:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2023-11-29 01:06:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1279. [2023-11-29 01:06:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 758 states have (on average 2.0356200527704487) internal successors, (1543), 1269 states have internal predecessors, (1543), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 01:06:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1557 transitions. [2023-11-29 01:06:01,446 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1557 transitions. Word has length 16 [2023-11-29 01:06:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:01,447 INFO L495 AbstractCegarLoop]: Abstraction has 1279 states and 1557 transitions. [2023-11-29 01:06:01,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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 01:06:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1557 transitions. [2023-11-29 01:06:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 01:06:01,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:01,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:01,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:01,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:01,652 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:01,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash 23415554, now seen corresponding path program 1 times [2023-11-29 01:06:01,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:01,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278912137] [2023-11-29 01:06:01,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:01,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:01,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:01,654 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:01,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:01,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:06:01,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:01,810 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 01:06:01,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:01,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:01,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278912137] [2023-11-29 01:06:01,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278912137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:01,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:01,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:06:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043400405] [2023-11-29 01:06:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:01,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:06:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:01,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:06:01,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:01,812 INFO L87 Difference]: Start difference. First operand 1279 states and 1557 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 01:06:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:02,792 INFO L93 Difference]: Finished difference Result 1225 states and 1477 transitions. [2023-11-29 01:06:02,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:06:02,794 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 01:06:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:02,799 INFO L225 Difference]: With dead ends: 1225 [2023-11-29 01:06:02,799 INFO L226 Difference]: Without dead ends: 1225 [2023-11-29 01:06:02,799 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 01:06:02,800 INFO L413 NwaCegarLoop]: 898 mSDtfsCounter, 70 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:02,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1747 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 01:06:02,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2023-11-29 01:06:02,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2023-11-29 01:06:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 728 states have (on average 2.0096153846153846) internal successors, (1463), 1215 states have internal predecessors, (1463), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 01:06:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1477 transitions. [2023-11-29 01:06:02,815 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1477 transitions. Word has length 16 [2023-11-29 01:06:02,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:02,816 INFO L495 AbstractCegarLoop]: Abstraction has 1225 states and 1477 transitions. [2023-11-29 01:06:02,816 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 01:06:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1477 transitions. [2023-11-29 01:06:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 01:06:02,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:02,817 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 01:06:02,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 01:06:03,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:03,017 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:03,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1027508316, now seen corresponding path program 1 times [2023-11-29 01:06:03,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:03,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924682854] [2023-11-29 01:06:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:03,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:03,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:03,019 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:03,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:03,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:06:03,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:03,191 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 01:06:03,191 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:03,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:03,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924682854] [2023-11-29 01:06:03,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924682854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:03,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:03,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:06:03,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806410962] [2023-11-29 01:06:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:03,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:03,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:03,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:03,193 INFO L87 Difference]: Start difference. First operand 1225 states and 1477 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 01:06:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:04,312 INFO L93 Difference]: Finished difference Result 1211 states and 1435 transitions. [2023-11-29 01:06:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:04,314 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 01:06:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:04,321 INFO L225 Difference]: With dead ends: 1211 [2023-11-29 01:06:04,321 INFO L226 Difference]: Without dead ends: 1211 [2023-11-29 01:06:04,321 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 01:06:04,322 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 58 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:04,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2577 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 01:06:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2023-11-29 01:06:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1209. [2023-11-29 01:06:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 726 states have (on average 1.9545454545454546) internal successors, (1419), 1199 states have internal predecessors, (1419), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 01:06:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1433 transitions. [2023-11-29 01:06:04,338 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1433 transitions. Word has length 18 [2023-11-29 01:06:04,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:04,339 INFO L495 AbstractCegarLoop]: Abstraction has 1209 states and 1433 transitions. [2023-11-29 01:06:04,339 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 01:06:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1433 transitions. [2023-11-29 01:06:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 01:06:04,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:04,340 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 01:06:04,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:04,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:04,540 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr378REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:04,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1240889876, now seen corresponding path program 1 times [2023-11-29 01:06:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:04,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919163008] [2023-11-29 01:06:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:04,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:04,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:04,542 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:04,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:04,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:06:04,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:04,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:06:04,777 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 01:06:04,777 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:04,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:04,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919163008] [2023-11-29 01:06:04,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919163008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:04,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:04,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:06:04,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852057231] [2023-11-29 01:06:04,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:04,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:04,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:04,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:04,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:04,779 INFO L87 Difference]: Start difference. First operand 1209 states and 1433 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 01:06:07,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:07,258 INFO L93 Difference]: Finished difference Result 1377 states and 1602 transitions. [2023-11-29 01:06:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:07,258 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 01:06:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:07,263 INFO L225 Difference]: With dead ends: 1377 [2023-11-29 01:06:07,263 INFO L226 Difference]: Without dead ends: 1377 [2023-11-29 01:06:07,264 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 01:06:07,264 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 879 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:07,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1144 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 01:06:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2023-11-29 01:06:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1205. [2023-11-29 01:06:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 726 states have (on average 1.93801652892562) internal successors, (1407), 1195 states have internal predecessors, (1407), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 01:06:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1421 transitions. [2023-11-29 01:06:07,280 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1421 transitions. Word has length 29 [2023-11-29 01:06:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:07,281 INFO L495 AbstractCegarLoop]: Abstraction has 1205 states and 1421 transitions. [2023-11-29 01:06:07,281 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 01:06:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1421 transitions. [2023-11-29 01:06:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 01:06:07,282 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:07,282 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 01:06:07,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:07,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:07,482 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr379REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:07,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1240889875, now seen corresponding path program 1 times [2023-11-29 01:06:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:07,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783657532] [2023-11-29 01:06:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:07,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:07,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:07,485 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:07,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:07,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:06:07,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:07,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:06:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:07,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:07,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783657532] [2023-11-29 01:06:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783657532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:07,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:07,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:06:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476366912] [2023-11-29 01:06:07,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:07,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:07,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:07,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:07,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:07,774 INFO L87 Difference]: Start difference. First operand 1205 states and 1421 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 01:06:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:11,824 INFO L93 Difference]: Finished difference Result 1806 states and 2156 transitions. [2023-11-29 01:06:11,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:11,824 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 01:06:11,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:11,831 INFO L225 Difference]: With dead ends: 1806 [2023-11-29 01:06:11,831 INFO L226 Difference]: Without dead ends: 1806 [2023-11-29 01:06:11,831 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 01:06:11,832 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 518 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:11,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1616 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 01:06:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2023-11-29 01:06:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1471. [2023-11-29 01:06:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 990 states have (on average 1.9454545454545455) internal successors, (1926), 1459 states have internal predecessors, (1926), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 01:06:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1944 transitions. [2023-11-29 01:06:11,852 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1944 transitions. Word has length 29 [2023-11-29 01:06:11,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:11,852 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 1944 transitions. [2023-11-29 01:06:11,852 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 01:06:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1944 transitions. [2023-11-29 01:06:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 01:06:11,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:11,853 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 01:06:11,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:12,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:12,054 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:12,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash -692644918, now seen corresponding path program 1 times [2023-11-29 01:06:12,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:12,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304245347] [2023-11-29 01:06:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:12,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:12,057 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:12,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:12,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:06:12,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:12,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:06:12,283 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 01:06:12,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:12,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:12,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304245347] [2023-11-29 01:06:12,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304245347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:12,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:12,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:06:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115114508] [2023-11-29 01:06:12,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:12,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:12,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:12,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:12,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:12,285 INFO L87 Difference]: Start difference. First operand 1471 states and 1944 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 01:06:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:15,457 INFO L93 Difference]: Finished difference Result 1867 states and 2465 transitions. [2023-11-29 01:06:15,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:15,458 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 01:06:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:15,466 INFO L225 Difference]: With dead ends: 1867 [2023-11-29 01:06:15,466 INFO L226 Difference]: Without dead ends: 1867 [2023-11-29 01:06:15,466 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 01:06:15,467 INFO L413 NwaCegarLoop]: 820 mSDtfsCounter, 746 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:15,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1661 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 01:06:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2023-11-29 01:06:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1467. [2023-11-29 01:06:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 990 states have (on average 1.9373737373737374) internal successors, (1918), 1455 states have internal predecessors, (1918), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 01:06:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1936 transitions. [2023-11-29 01:06:15,495 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1936 transitions. Word has length 32 [2023-11-29 01:06:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:15,495 INFO L495 AbstractCegarLoop]: Abstraction has 1467 states and 1936 transitions. [2023-11-29 01:06:15,495 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 01:06:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1936 transitions. [2023-11-29 01:06:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 01:06:15,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:15,496 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 01:06:15,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:15,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:15,697 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:15,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash -692644917, now seen corresponding path program 1 times [2023-11-29 01:06:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:15,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104177217] [2023-11-29 01:06:15,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:15,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:15,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:15,699 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:15,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:15,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:06:15,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:15,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:06:16,023 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 01:06:16,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:16,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104177217] [2023-11-29 01:06:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104177217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:16,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:16,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:06:16,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291067355] [2023-11-29 01:06:16,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:16,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:16,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:16,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:16,026 INFO L87 Difference]: Start difference. First operand 1467 states and 1936 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 01:06:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:20,065 INFO L93 Difference]: Finished difference Result 1920 states and 2484 transitions. [2023-11-29 01:06:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:20,066 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 01:06:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:20,075 INFO L225 Difference]: With dead ends: 1920 [2023-11-29 01:06:20,075 INFO L226 Difference]: Without dead ends: 1920 [2023-11-29 01:06:20,075 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 01:06:20,076 INFO L413 NwaCegarLoop]: 1052 mSDtfsCounter, 476 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:20,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 2091 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 01:06:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2023-11-29 01:06:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1463. [2023-11-29 01:06:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 990 states have (on average 1.9292929292929293) internal successors, (1910), 1451 states have internal predecessors, (1910), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 01:06:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 1928 transitions. [2023-11-29 01:06:20,106 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 1928 transitions. Word has length 32 [2023-11-29 01:06:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:20,107 INFO L495 AbstractCegarLoop]: Abstraction has 1463 states and 1928 transitions. [2023-11-29 01:06:20,107 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 01:06:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1928 transitions. [2023-11-29 01:06:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-29 01:06:20,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:20,109 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] [2023-11-29 01:06:20,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:20,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:20,309 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:20,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:20,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1146832483, now seen corresponding path program 1 times [2023-11-29 01:06:20,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:20,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378560255] [2023-11-29 01:06:20,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:20,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:20,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:20,311 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:20,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:20,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:06:20,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:20,503 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 01:06:20,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:20,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:20,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378560255] [2023-11-29 01:06:20,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378560255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:20,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:20,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:06:20,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66399346] [2023-11-29 01:06:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:20,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:20,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:20,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:20,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:20,504 INFO L87 Difference]: Start difference. First operand 1463 states and 1928 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:21,647 INFO L93 Difference]: Finished difference Result 1433 states and 1878 transitions. [2023-11-29 01:06:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:21,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2023-11-29 01:06:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:21,657 INFO L225 Difference]: With dead ends: 1433 [2023-11-29 01:06:21,657 INFO L226 Difference]: Without dead ends: 1433 [2023-11-29 01:06:21,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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 01:06:21,658 INFO L413 NwaCegarLoop]: 857 mSDtfsCounter, 31 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:21,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2543 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 01:06:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2023-11-29 01:06:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2023-11-29 01:06:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 960 states have (on average 1.9375) internal successors, (1860), 1421 states have internal predecessors, (1860), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 01:06:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1878 transitions. [2023-11-29 01:06:21,678 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1878 transitions. Word has length 48 [2023-11-29 01:06:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:21,678 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 1878 transitions. [2023-11-29 01:06:21,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1878 transitions. [2023-11-29 01:06:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 01:06:21,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:21,679 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 01:06:21,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:21,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:21,880 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:21,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash 135272355, now seen corresponding path program 1 times [2023-11-29 01:06:21,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:21,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119052440] [2023-11-29 01:06:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:21,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:21,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:21,882 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:21,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:22,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:06:22,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:22,194 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 01:06:22,194 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:22,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:22,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119052440] [2023-11-29 01:06:22,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119052440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:22,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:22,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:06:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984621850] [2023-11-29 01:06:22,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:22,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:22,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:22,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:22,196 INFO L87 Difference]: Start difference. First operand 1433 states and 1878 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 01:06:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:23,333 INFO L93 Difference]: Finished difference Result 1421 states and 1858 transitions. [2023-11-29 01:06:23,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:23,335 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 01:06:23,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:23,339 INFO L225 Difference]: With dead ends: 1421 [2023-11-29 01:06:23,339 INFO L226 Difference]: Without dead ends: 1421 [2023-11-29 01:06:23,339 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 01:06:23,340 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 23 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:23,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2539 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 01:06:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2023-11-29 01:06:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1421. [2023-11-29 01:06:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 948 states have (on average 1.9409282700421941) internal successors, (1840), 1409 states have internal predecessors, (1840), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 01:06:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1858 transitions. [2023-11-29 01:06:23,357 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1858 transitions. Word has length 51 [2023-11-29 01:06:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:23,357 INFO L495 AbstractCegarLoop]: Abstraction has 1421 states and 1858 transitions. [2023-11-29 01:06:23,357 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 01:06:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1858 transitions. [2023-11-29 01:06:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 01:06:23,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:23,358 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] [2023-11-29 01:06:23,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:23,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:23,559 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:23,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:23,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1077602402, now seen corresponding path program 1 times [2023-11-29 01:06:23,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:23,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683705980] [2023-11-29 01:06:23,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:23,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:23,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:23,560 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:23,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:23,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:06:23,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:23,743 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 01:06:23,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:23,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:23,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683705980] [2023-11-29 01:06:23,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683705980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:23,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:23,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:06:23,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477776597] [2023-11-29 01:06:23,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:23,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:06:23,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:23,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:06:23,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:23,745 INFO L87 Difference]: Start difference. First operand 1421 states and 1858 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:24,677 INFO L93 Difference]: Finished difference Result 1444 states and 1552 transitions. [2023-11-29 01:06:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:06:24,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-11-29 01:06:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:24,682 INFO L225 Difference]: With dead ends: 1444 [2023-11-29 01:06:24,682 INFO L226 Difference]: Without dead ends: 1444 [2023-11-29 01:06:24,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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 01:06:24,682 INFO L413 NwaCegarLoop]: 1095 mSDtfsCounter, 287 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:24,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1905 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:06:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2023-11-29 01:06:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1120. [2023-11-29 01:06:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 649 states have (on average 1.8428351309707243) internal successors, (1196), 1110 states have internal predecessors, (1196), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 01:06:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1210 transitions. [2023-11-29 01:06:24,696 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1210 transitions. Word has length 52 [2023-11-29 01:06:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:24,696 INFO L495 AbstractCegarLoop]: Abstraction has 1120 states and 1210 transitions. [2023-11-29 01:06:24,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1210 transitions. [2023-11-29 01:06:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 01:06:24,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:24,697 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 01:06:24,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:24,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:24,898 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:24,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1619311894, now seen corresponding path program 1 times [2023-11-29 01:06:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:24,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626903533] [2023-11-29 01:06:24,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:24,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:24,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:24,900 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:24,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:25,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:06:25,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:25,121 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:06:25,121 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:06:25,122 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:06:25,125 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 01:06:25,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:06:25,192 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 01:06:25,241 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 01:06:25,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:25,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:25,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626903533] [2023-11-29 01:06:25,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626903533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:25,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:25,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:06:25,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275270876] [2023-11-29 01:06:25,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:25,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:06:25,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:25,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:06:25,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:06:25,243 INFO L87 Difference]: Start difference. First operand 1120 states and 1210 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:27,483 INFO L93 Difference]: Finished difference Result 1932 states and 2069 transitions. [2023-11-29 01:06:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:06:27,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 01:06:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:27,489 INFO L225 Difference]: With dead ends: 1932 [2023-11-29 01:06:27,489 INFO L226 Difference]: Without dead ends: 1929 [2023-11-29 01:06:27,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 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 01:06:27,490 INFO L413 NwaCegarLoop]: 855 mSDtfsCounter, 2766 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2776 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:27,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2776 Valid, 3387 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 01:06:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2023-11-29 01:06:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1072. [2023-11-29 01:06:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 602 states have (on average 1.9069767441860466) internal successors, (1148), 1063 states have internal predecessors, (1148), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:06:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1160 transitions. [2023-11-29 01:06:27,511 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1160 transitions. Word has length 55 [2023-11-29 01:06:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:27,511 INFO L495 AbstractCegarLoop]: Abstraction has 1072 states and 1160 transitions. [2023-11-29 01:06:27,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1160 transitions. [2023-11-29 01:06:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 01:06:27,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:27,512 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 01:06:27,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:27,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:27,713 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:27,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:27,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1454134306, now seen corresponding path program 1 times [2023-11-29 01:06:27,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:27,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870462641] [2023-11-29 01:06:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:27,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:27,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:27,715 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:27,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:28,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 01:06:28,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:28,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:06:28,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:06:28,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:06:28,502 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 01:06:28,514 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:06:28,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:06:28,528 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 01:06:28,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:28,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:28,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870462641] [2023-11-29 01:06:28,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870462641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:28,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:28,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:06:28,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928137743] [2023-11-29 01:06:28,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:28,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:28,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:28,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:28,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:28,529 INFO L87 Difference]: Start difference. First operand 1072 states and 1160 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 01:06:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:31,545 INFO L93 Difference]: Finished difference Result 1370 states and 1483 transitions. [2023-11-29 01:06:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:31,546 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 01:06:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:31,548 INFO L225 Difference]: With dead ends: 1370 [2023-11-29 01:06:31,549 INFO L226 Difference]: Without dead ends: 1370 [2023-11-29 01:06:31,549 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 01:06:31,549 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 1580 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:31,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 598 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 01:06:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2023-11-29 01:06:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1011. [2023-11-29 01:06:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 579 states have (on average 1.8186528497409327) internal successors, (1053), 1002 states have internal predecessors, (1053), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:06:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1065 transitions. [2023-11-29 01:06:31,562 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1065 transitions. Word has length 55 [2023-11-29 01:06:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:31,562 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1065 transitions. [2023-11-29 01:06:31,562 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 01:06:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1065 transitions. [2023-11-29 01:06:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 01:06:31,563 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:31,563 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 01:06:31,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-29 01:06:31,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:31,763 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:31,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash 563770406, now seen corresponding path program 1 times [2023-11-29 01:06:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:31,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100084525] [2023-11-29 01:06:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:31,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:31,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:31,765 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:31,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:32,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:06:32,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:32,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:06:32,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:06:32,066 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 01:06:32,077 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 01:06:32,077 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:32,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:32,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100084525] [2023-11-29 01:06:32,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100084525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:32,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:32,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:06:32,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718085568] [2023-11-29 01:06:32,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:32,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:06:32,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:32,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:06:32,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:06:32,079 INFO L87 Difference]: Start difference. First operand 1011 states and 1065 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 01:06:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:35,312 INFO L93 Difference]: Finished difference Result 1010 states and 1064 transitions. [2023-11-29 01:06:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:06:35,313 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 01:06:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:35,315 INFO L225 Difference]: With dead ends: 1010 [2023-11-29 01:06:35,315 INFO L226 Difference]: Without dead ends: 1010 [2023-11-29 01:06:35,315 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 01:06:35,315 INFO L413 NwaCegarLoop]: 827 mSDtfsCounter, 3 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:35,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2134 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 01:06:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2023-11-29 01:06:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2023-11-29 01:06:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 579 states have (on average 1.8169257340241796) internal successors, (1052), 1001 states have internal predecessors, (1052), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:06:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1064 transitions. [2023-11-29 01:06:35,328 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1064 transitions. Word has length 59 [2023-11-29 01:06:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:35,328 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 1064 transitions. [2023-11-29 01:06:35,329 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 01:06:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1064 transitions. [2023-11-29 01:06:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 01:06:35,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:35,329 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 01:06:35,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:35,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:35,530 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:35,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:35,530 INFO L85 PathProgramCache]: Analyzing trace with hash 563770407, now seen corresponding path program 1 times [2023-11-29 01:06:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:35,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148488755] [2023-11-29 01:06:35,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:35,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:35,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:35,532 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:35,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:35,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 01:06:35,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:35,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:06:35,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:06:35,837 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 01:06:35,877 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 01:06:35,897 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 01:06:35,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:35,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148488755] [2023-11-29 01:06:35,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148488755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:35,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:35,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:06:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374224812] [2023-11-29 01:06:35,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:35,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:06:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:35,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:06:35,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:06:35,899 INFO L87 Difference]: Start difference. First operand 1010 states and 1064 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 01:06:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:39,903 INFO L93 Difference]: Finished difference Result 1009 states and 1063 transitions. [2023-11-29 01:06:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:06:39,903 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 01:06:39,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:39,905 INFO L225 Difference]: With dead ends: 1009 [2023-11-29 01:06:39,905 INFO L226 Difference]: Without dead ends: 1009 [2023-11-29 01:06:39,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:06:39,905 INFO L413 NwaCegarLoop]: 827 mSDtfsCounter, 1 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:39,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2175 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-11-29 01:06:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2023-11-29 01:06:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2023-11-29 01:06:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 578 states have (on average 1.8183391003460208) internal successors, (1051), 1000 states have internal predecessors, (1051), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 01:06:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1063 transitions. [2023-11-29 01:06:39,915 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1063 transitions. Word has length 59 [2023-11-29 01:06:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:39,915 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1063 transitions. [2023-11-29 01:06:39,915 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 01:06:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1063 transitions. [2023-11-29 01:06:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 01:06:39,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:39,916 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 01:06:39,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:40,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:40,117 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:40,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:40,117 INFO L85 PathProgramCache]: Analyzing trace with hash 305236554, now seen corresponding path program 1 times [2023-11-29 01:06:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:40,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963584425] [2023-11-29 01:06:40,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:40,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:40,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:40,118 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:40,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:40,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:06:40,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:40,385 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 01:06:40,385 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:40,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:40,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963584425] [2023-11-29 01:06:40,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963584425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:40,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:40,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:06:40,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533616532] [2023-11-29 01:06:40,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:40,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:40,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:40,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:40,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:40,388 INFO L87 Difference]: Start difference. First operand 1009 states and 1063 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 01:06:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:41,578 INFO L93 Difference]: Finished difference Result 1011 states and 1066 transitions. [2023-11-29 01:06:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:41,580 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 01:06:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:41,583 INFO L225 Difference]: With dead ends: 1011 [2023-11-29 01:06:41,583 INFO L226 Difference]: Without dead ends: 1011 [2023-11-29 01:06:41,583 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 01:06:41,584 INFO L413 NwaCegarLoop]: 827 mSDtfsCounter, 1 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:41,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2478 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 01:06:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2023-11-29 01:06:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2023-11-29 01:06:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 579 states have (on average 1.8186528497409327) internal successors, (1053), 1002 states have internal predecessors, (1053), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:06:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1066 transitions. [2023-11-29 01:06:41,604 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1066 transitions. Word has length 65 [2023-11-29 01:06:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:41,605 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1066 transitions. [2023-11-29 01:06:41,605 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 01:06:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1066 transitions. [2023-11-29 01:06:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 01:06:41,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:41,607 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 01:06:41,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:41,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:41,808 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:41,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:41,808 INFO L85 PathProgramCache]: Analyzing trace with hash -261016007, now seen corresponding path program 1 times [2023-11-29 01:06:41,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:41,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754956978] [2023-11-29 01:06:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:41,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:41,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:41,810 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:41,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:42,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:06:42,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:42,144 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 01:06:42,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:06:42,198 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 01:06:42,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754956978] [2023-11-29 01:06:42,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754956978] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:06:42,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:06:42,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 01:06:42,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394495348] [2023-11-29 01:06:42,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:06:42,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:06:42,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:42,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:06:42,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:06:42,201 INFO L87 Difference]: Start difference. First operand 1011 states and 1066 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 01:06:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:44,026 INFO L93 Difference]: Finished difference Result 1020 states and 1080 transitions. [2023-11-29 01:06:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:06:44,027 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 01:06:44,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:44,030 INFO L225 Difference]: With dead ends: 1020 [2023-11-29 01:06:44,030 INFO L226 Difference]: Without dead ends: 1020 [2023-11-29 01:06:44,030 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 01:06:44,031 INFO L413 NwaCegarLoop]: 826 mSDtfsCounter, 7 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4124 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:44,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4124 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 01:06:44,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2023-11-29 01:06:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1019. [2023-11-29 01:06:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 586 states have (on average 1.819112627986348) internal successors, (1066), 1009 states have internal predecessors, (1066), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:06:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1079 transitions. [2023-11-29 01:06:44,048 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1079 transitions. Word has length 66 [2023-11-29 01:06:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:44,048 INFO L495 AbstractCegarLoop]: Abstraction has 1019 states and 1079 transitions. [2023-11-29 01:06:44,048 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 01:06:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1079 transitions. [2023-11-29 01:06:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 01:06:44,049 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:44,049 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 01:06:44,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:44,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:44,250 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:44,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:44,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2058653194, now seen corresponding path program 2 times [2023-11-29 01:06:44,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:44,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041304182] [2023-11-29 01:06:44,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:06:44,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:44,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:44,251 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:44,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:44,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:06:44,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:06:44,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:06:44,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:44,738 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 01:06:44,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:06:44,881 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 01:06:44,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:44,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041304182] [2023-11-29 01:06:44,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041304182] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:06:44,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:06:44,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 01:06:44,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679488445] [2023-11-29 01:06:44,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:06:44,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:06:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:44,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:06:44,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:06:44,883 INFO L87 Difference]: Start difference. First operand 1019 states and 1079 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 01:06:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:47,925 INFO L93 Difference]: Finished difference Result 1034 states and 1101 transitions. [2023-11-29 01:06:47,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:06:47,926 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 01:06:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:47,928 INFO L225 Difference]: With dead ends: 1034 [2023-11-29 01:06:47,928 INFO L226 Difference]: Without dead ends: 1032 [2023-11-29 01:06:47,929 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 01:06:47,929 INFO L413 NwaCegarLoop]: 826 mSDtfsCounter, 12 mSDsluCounter, 5772 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6598 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:47,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6598 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 01:06:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2023-11-29 01:06:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1028. [2023-11-29 01:06:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 595 states have (on average 1.811764705882353) internal successors, (1078), 1018 states have internal predecessors, (1078), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:06:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1091 transitions. [2023-11-29 01:06:47,941 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1091 transitions. Word has length 69 [2023-11-29 01:06:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:47,941 INFO L495 AbstractCegarLoop]: Abstraction has 1028 states and 1091 transitions. [2023-11-29 01:06:47,941 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 01:06:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1091 transitions. [2023-11-29 01:06:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 01:06:47,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:47,942 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 01:06:47,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:48,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:48,143 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:48,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1201229738, now seen corresponding path program 3 times [2023-11-29 01:06:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:48,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376309274] [2023-11-29 01:06:48,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:06:48,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:48,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:48,145 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:48,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:48,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 01:06:48,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:06:48,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 01:06:48,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:48,977 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 01:06:48,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:06:49,529 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 01:06:49,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:49,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376309274] [2023-11-29 01:06:49,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376309274] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:06:49,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:06:49,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 01:06:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562055007] [2023-11-29 01:06:49,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:06:49,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 01:06:49,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:49,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 01:06:49,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 01:06:49,532 INFO L87 Difference]: Start difference. First operand 1028 states and 1091 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 01:06:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:56,200 INFO L93 Difference]: Finished difference Result 1058 states and 1141 transitions. [2023-11-29 01:06:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 01:06:56,201 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 01:06:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:56,203 INFO L225 Difference]: With dead ends: 1058 [2023-11-29 01:06:56,203 INFO L226 Difference]: Without dead ends: 1055 [2023-11-29 01:06:56,204 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 01:06:56,205 INFO L413 NwaCegarLoop]: 825 mSDtfsCounter, 24 mSDsluCounter, 11529 mSDsCounter, 0 mSdLazyCounter, 2247 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12354 SdHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:56,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12354 Invalid, 2262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2247 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-11-29 01:06:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2023-11-29 01:06:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1046. [2023-11-29 01:06:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 613 states have (on average 1.796084828711256) internal successors, (1101), 1036 states have internal predecessors, (1101), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:06:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1114 transitions. [2023-11-29 01:06:56,220 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1114 transitions. Word has length 75 [2023-11-29 01:06:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:56,220 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 1114 transitions. [2023-11-29 01:06:56,220 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 01:06:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1114 transitions. [2023-11-29 01:06:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 01:06:56,221 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:56,221 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 01:06:56,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:56,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:56,421 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:06:56,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash -323114262, now seen corresponding path program 4 times [2023-11-29 01:06:56,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:56,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548570920] [2023-11-29 01:06:56,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:06:56,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:56,423 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:56,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:56,773 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:06:56,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:06:56,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 01:06:56,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:57,142 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 01:06:57,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:06:58,750 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 01:06:58,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548570920] [2023-11-29 01:06:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548570920] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:06:58,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:06:58,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 01:06:58,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106302459] [2023-11-29 01:06:58,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:06:58,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 01:06:58,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 01:06:58,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 01:06:58,754 INFO L87 Difference]: Start difference. First operand 1046 states and 1114 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 01:07:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:14,643 INFO L93 Difference]: Finished difference Result 1103 states and 1203 transitions. [2023-11-29 01:07:14,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 01:07:14,644 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 01:07:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:14,646 INFO L225 Difference]: With dead ends: 1103 [2023-11-29 01:07:14,647 INFO L226 Difference]: Without dead ends: 1101 [2023-11-29 01:07:14,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 01:07:14,651 INFO L413 NwaCegarLoop]: 826 mSDtfsCounter, 48 mSDsluCounter, 22271 mSDsCounter, 0 mSdLazyCounter, 5257 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 23097 SdHoareTripleChecker+Invalid, 5345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 5257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:14,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 23097 Invalid, 5345 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [88 Valid, 5257 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2023-11-29 01:07:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2023-11-29 01:07:14,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1080. [2023-11-29 01:07:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 647 states have (on average 1.7727975270479135) internal successors, (1147), 1070 states have internal predecessors, (1147), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:07:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1160 transitions. [2023-11-29 01:07:14,667 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1160 transitions. Word has length 87 [2023-11-29 01:07:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:14,667 INFO L495 AbstractCegarLoop]: Abstraction has 1080 states and 1160 transitions. [2023-11-29 01:07:14,667 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 01:07:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1160 transitions. [2023-11-29 01:07:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 01:07:14,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:14,668 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 01:07:14,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-11-29 01:07:14,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:07:14,869 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:07:14,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:14,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1468951670, now seen corresponding path program 5 times [2023-11-29 01:07:14,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:07:14,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47061127] [2023-11-29 01:07:14,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:07:14,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:07:14,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:07:14,871 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:07:14,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:07:16,252 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 01:07:16,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:07:16,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 01:07:16,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:16,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:07:16,393 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:07:16,393 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 01:07:16,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:07:16,511 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 01:07:17,421 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:07:17,422 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 01:07:17,464 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 01:07:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:07:17,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:07:19,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:07:19,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47061127] [2023-11-29 01:07:19,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47061127] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:19,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1432442211] [2023-11-29 01:07:19,869 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:07:19,869 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:07:19,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:07:19,870 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:07:19,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 01:08:29,168 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 01:08:29,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:08:29,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 01:08:29,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:08:29,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:08:29,784 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:08:29,785 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 01:08:29,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:08:30,037 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 01:08:31,088 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:08:31,088 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 01:08:31,186 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 01:08:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:08:31,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:08:31,654 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2657 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2657) |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 01:08:31,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1432442211] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:08:31,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:08:31,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 01:08:31,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070463143] [2023-11-29 01:08:31,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:08:31,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:08:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:08:31,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:08:31,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=187, Unknown=1, NotChecked=28, Total=272 [2023-11-29 01:08:31,659 INFO L87 Difference]: Start difference. First operand 1080 states and 1160 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 01:08:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:08:40,466 INFO L93 Difference]: Finished difference Result 1417 states and 1520 transitions. [2023-11-29 01:08:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:08:40,468 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 01:08:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:08:40,470 INFO L225 Difference]: With dead ends: 1417 [2023-11-29 01:08:40,471 INFO L226 Difference]: Without dead ends: 1415 [2023-11-29 01:08:40,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=65, Invalid=210, Unknown=1, NotChecked=30, Total=306 [2023-11-29 01:08:40,472 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 630 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 3746 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 3414 SdHoareTripleChecker+Invalid, 3753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:08:40,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 3414 Invalid, 3753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3746 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-11-29 01:08:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2023-11-29 01:08:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1079. [2023-11-29 01:08:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 647 states have (on average 1.7650695517774344) internal successors, (1142), 1069 states have internal predecessors, (1142), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:08:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1155 transitions. [2023-11-29 01:08:40,487 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1155 transitions. Word has length 109 [2023-11-29 01:08:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:08:40,487 INFO L495 AbstractCegarLoop]: Abstraction has 1079 states and 1155 transitions. [2023-11-29 01:08:40,487 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 01:08:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1155 transitions. [2023-11-29 01:08:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 01:08:40,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:08:40,488 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 01:08:40,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:08:40,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 01:08:40,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:08:40,889 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:08:40,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:08:40,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1468951669, now seen corresponding path program 1 times [2023-11-29 01:08:40,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:08:40,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202094486] [2023-11-29 01:08:40,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:08:40,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:08:40,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:08:40,891 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:08:40,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:08:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:08:41,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 01:08:41,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:08:41,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:08:41,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:08:41,860 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:08:41,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:08:41,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 15 treesize of output 1 [2023-11-29 01:08:41,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:08:42,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:08:42,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:08:42,848 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:08:42,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:08:42,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:08:42,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:08:42,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:08:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:08:42,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:08:44,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3210 (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_3210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3210 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 01:08:44,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:08:44,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202094486] [2023-11-29 01:08:44,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202094486] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:08:44,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1070411041] [2023-11-29 01:08:44,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:08:44,397 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:08:44,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:08:44,403 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:08:44,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 01:10:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:26,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 01:10:26,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:26,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:10:27,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:10:27,181 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:10:27,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:10:27,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:10:27,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:10:27,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:10:27,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:10:28,050 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:10:28,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:10:28,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:10:28,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:10:28,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:10:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:10:28,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:29,601 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3764 (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_3765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3764) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3765 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 01:10:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1070411041] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:29,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:10:29,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 01:10:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132573508] [2023-11-29 01:10:29,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:29,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:10:29,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:10:29,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:10:29,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 01:10:29,608 INFO L87 Difference]: Start difference. First operand 1079 states and 1155 transitions. Second operand has 9 states, 7 states have (on average 9.285714285714286) internal successors, (65), 9 states have internal predecessors, (65), 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 01:10:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:39,520 INFO L93 Difference]: Finished difference Result 1414 states and 1515 transitions. [2023-11-29 01:10:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:10:39,521 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.285714285714286) internal successors, (65), 9 states have internal predecessors, (65), 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 109 [2023-11-29 01:10:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:39,524 INFO L225 Difference]: With dead ends: 1414 [2023-11-29 01:10:39,524 INFO L226 Difference]: Without dead ends: 1414 [2023-11-29 01:10:39,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 01:10:39,525 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 586 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 3841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:39,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 2393 Invalid, 3841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3834 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2023-11-29 01:10:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2023-11-29 01:10:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1078. [2023-11-29 01:10:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 647 states have (on average 1.7635239567233385) internal successors, (1141), 1068 states have internal predecessors, (1141), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:10:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1154 transitions. [2023-11-29 01:10:39,536 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1154 transitions. Word has length 109 [2023-11-29 01:10:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:39,536 INFO L495 AbstractCegarLoop]: Abstraction has 1078 states and 1154 transitions. [2023-11-29 01:10:39,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.285714285714286) internal successors, (65), 9 states have internal predecessors, (65), 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 01:10:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1154 transitions. [2023-11-29 01:10:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 01:10:39,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:39,537 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 01:10:39,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 01:10:39,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:10:39,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:10:39,938 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:10:39,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1383332532, now seen corresponding path program 1 times [2023-11-29 01:10:39,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:10:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384657046] [2023-11-29 01:10:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:39,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:10:39,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:10:39,940 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:10:39,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:10:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:40,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 01:10:40,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:40,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:10:40,936 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:10:40,936 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 01:10:40,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:10:41,065 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 01:10:41,988 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:10:41,988 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 01:10:42,121 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:10:42,121 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 01:10:42,134 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 01:10:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:10:42,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:42,231 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4189) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 01:10:42,243 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4189 (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_4189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:10:42,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:10:42,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384657046] [2023-11-29 01:10:42,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384657046] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:42,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1793254211] [2023-11-29 01:10:42,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:42,695 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:10:42,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:10:42,695 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:10:42,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 01:10:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:44,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 01:10:44,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:44,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:10:45,352 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:10:45,353 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 01:10:45,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:10:45,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 01:10:46,447 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:10:46,447 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 01:10:46,598 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:10:46,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 01:10:46,615 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 01:10:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:10:46,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:46,642 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4659 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4659) |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 01:10:46,655 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4659 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-29 01:10:47,082 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4705 (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_4705))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4659)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:10:47,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1793254211] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:47,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:10:47,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 01:10:47,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454040742] [2023-11-29 01:10:47,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:47,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 01:10:47,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:10:47,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:10:47,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=244, Unknown=6, NotChecked=180, Total=506 [2023-11-29 01:10:47,087 INFO L87 Difference]: Start difference. First operand 1078 states and 1154 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 01:10:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:56,948 INFO L93 Difference]: Finished difference Result 1413 states and 1514 transitions. [2023-11-29 01:10:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:10:56,950 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 01:10:56,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:56,952 INFO L225 Difference]: With dead ends: 1413 [2023-11-29 01:10:56,952 INFO L226 Difference]: Without dead ends: 1413 [2023-11-29 01:10:56,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=271, Unknown=6, NotChecked=190, Total=552 [2023-11-29 01:10:56,952 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 627 mSDsluCounter, 3389 mSDsCounter, 0 mSdLazyCounter, 4396 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 3933 SdHoareTripleChecker+Invalid, 4403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:56,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 3933 Invalid, 4403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4396 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2023-11-29 01:10:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2023-11-29 01:10:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1077. [2023-11-29 01:10:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 647 states have (on average 1.7619783616692426) internal successors, (1140), 1067 states have internal predecessors, (1140), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:10:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1153 transitions. [2023-11-29 01:10:56,963 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1153 transitions. Word has length 111 [2023-11-29 01:10:56,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:56,963 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1153 transitions. [2023-11-29 01:10:56,963 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 01:10:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1153 transitions. [2023-11-29 01:10:56,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 01:10:56,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:56,964 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 01:10:56,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 01:10:57,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:10:57,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:10:57,365 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:10:57,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:57,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1383332533, now seen corresponding path program 1 times [2023-11-29 01:10:57,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:10:57,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344350201] [2023-11-29 01:10:57,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:57,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:10:57,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:10:57,367 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:10:57,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:10:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:58,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 01:10:58,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:58,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:10:58,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:10:58,529 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:10:58,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:10:58,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:10:58,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:10:58,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:10:58,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:10:59,271 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:10:59,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:10:59,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:10:59,380 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:10:59,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:10:59,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:10:59,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:10:59,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:10:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:10:59,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:59,578 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5175 (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_5175) |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~mem40#1.base| v_ArrVal_5174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5175 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 01:10:59,611 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_5174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5175 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5175 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 01:11:00,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5266) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5175 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5266 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5267))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5266) .cse2 v_ArrVal_5175) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:11:00,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:11:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344350201] [2023-11-29 01:11:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344350201] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:11:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1798225900] [2023-11-29 01:11:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:11:00,944 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:11:00,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:11:00,944 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:11:00,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 01:12:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:40,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 01:12:40,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:40,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:12:40,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:12:40,946 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:12:40,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:12:40,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:12:40,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:12:41,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:12:41,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:12:41,650 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:12:41,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:12:41,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:12:41,745 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:12:41,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:12:41,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:12:41,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:12:41,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:12:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:12:41,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:12:41,829 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5737 (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_5737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5736 (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_5737) |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_5736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:12:41,866 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_5737 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5736 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:12:43,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5829 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5829))) (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_5828) .cse0 v_ArrVal_5737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5829 (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_5828) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5829) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5737) |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 01:12:43,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1798225900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:12:43,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:12:43,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 01:12:43,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287157692] [2023-11-29 01:12:43,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:12:43,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:12:43,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:12:43,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:12:43,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2023-11-29 01:12:43,226 INFO L87 Difference]: Start difference. First operand 1077 states and 1153 transitions. Second operand has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 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 01:12:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:52,860 INFO L93 Difference]: Finished difference Result 1412 states and 1513 transitions. [2023-11-29 01:12:52,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:12:52,862 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 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 111 [2023-11-29 01:12:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:52,864 INFO L225 Difference]: With dead ends: 1412 [2023-11-29 01:12:52,865 INFO L226 Difference]: Without dead ends: 1412 [2023-11-29 01:12:52,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 213 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2023-11-29 01:12:52,865 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 584 mSDsluCounter, 2121 mSDsCounter, 0 mSdLazyCounter, 4457 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 2692 SdHoareTripleChecker+Invalid, 4464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:52,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 2692 Invalid, 4464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4457 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2023-11-29 01:12:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2023-11-29 01:12:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1076. [2023-11-29 01:12:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 647 states have (on average 1.760432766615147) internal successors, (1139), 1066 states have internal predecessors, (1139), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:12:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1152 transitions. [2023-11-29 01:12:52,880 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1152 transitions. Word has length 111 [2023-11-29 01:12:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:52,881 INFO L495 AbstractCegarLoop]: Abstraction has 1076 states and 1152 transitions. [2023-11-29 01:12:52,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.375) internal successors, (67), 10 states have internal predecessors, (67), 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 01:12:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1152 transitions. [2023-11-29 01:12:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 01:12:52,882 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:52,882 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 01:12:52,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 01:12:53,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:12:53,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:12:53,283 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:12:53,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:53,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2055656070, now seen corresponding path program 1 times [2023-11-29 01:12:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:12:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960289875] [2023-11-29 01:12:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:53,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:12:53,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:12:53,285 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:12:53,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:12:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:54,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 01:12:54,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:54,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:12:54,554 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:12:54,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:12:54,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:12:54,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:12:54,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:12:54,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:12:54,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:12:55,384 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:12:55,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:12:55,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:12:55,510 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:12:55,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:12:55,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:12:55,602 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:12:55,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:12:55,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:12:55,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:12:55,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:12:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:12:55,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:12:55,812 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6315 (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_6315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:12:55,845 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_6315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6315 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:12:55,914 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6314 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6314))) (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~mem40#1.base| v_ArrVal_6313) .cse0 v_ArrVal_6315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6314 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6313) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 01:13:00,071 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6314 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6407))) (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~mem38#1.base| v_ArrVal_6408) .cse1 v_ArrVal_6313) (select (select (store .cse2 .cse1 v_ArrVal_6314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6315))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6314 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6407))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6314))) (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~mem38#1.base| v_ArrVal_6408) .cse4 v_ArrVal_6313) .cse5 v_ArrVal_6315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:13:00,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:13:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960289875] [2023-11-29 01:13:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960289875] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:13:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [223686775] [2023-11-29 01:13:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:00,087 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:13:00,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:13:00,088 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:13:00,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 01:13:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:27,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 01:13:27,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:13:27,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:13:28,349 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:13:28,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:13:28,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:13:28,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:13:28,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:13:28,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:13:28,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:13:29,436 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:13:29,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:13:29,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:13:29,583 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:13:29,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:13:29,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:13:29,661 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:13:29,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:13:29,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:13:29,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:13:29,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:13:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:13:29,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:13:29,769 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6895 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6894 (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_6895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:13:29,806 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_6895 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6894 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:13:29,895 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6894 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6892))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6893) .cse0 v_ArrVal_6895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6893 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6893) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6892) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2023-11-29 01:13:30,005 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_6895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6893 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6893) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6892) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_6895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6894 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6892))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6893) .cse3 v_ArrVal_6895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:13:32,298 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6893 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6987))) (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~mem38#1.base| v_ArrVal_6986) .cse1 v_ArrVal_6893) (select (select (store .cse2 .cse1 v_ArrVal_6892) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6895))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6987 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6894 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6987))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6892))) (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~mem38#1.base| v_ArrVal_6986) .cse4 v_ArrVal_6893) .cse5 v_ArrVal_6895) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:13:32,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [223686775] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:13:32,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:13:32,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-11-29 01:13:32,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017018748] [2023-11-29 01:13:32,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:13:32,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 01:13:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:13:32,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:13:32,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=148, Unknown=14, NotChecked=288, Total=506 [2023-11-29 01:13:32,316 INFO L87 Difference]: Start difference. First operand 1076 states and 1152 transitions. Second operand has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 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 01:13:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:13:51,280 INFO L93 Difference]: Finished difference Result 1411 states and 1512 transitions. [2023-11-29 01:13:51,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:13:51,282 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 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 113 [2023-11-29 01:13:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:13:51,286 INFO L225 Difference]: With dead ends: 1411 [2023-11-29 01:13:51,286 INFO L226 Difference]: Without dead ends: 1411 [2023-11-29 01:13:51,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=99, Invalid=302, Unknown=15, NotChecked=396, Total=812 [2023-11-29 01:13:51,287 INFO L413 NwaCegarLoop]: 570 mSDtfsCounter, 582 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 5084 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 5090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:13:51,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 2987 Invalid, 5090 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 5084 Invalid, 0 Unknown, 0 Unchecked, 18.3s Time] [2023-11-29 01:13:51,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2023-11-29 01:13:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1075. [2023-11-29 01:13:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 647 states have (on average 1.758887171561051) internal successors, (1138), 1065 states have internal predecessors, (1138), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:13:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1151 transitions. [2023-11-29 01:13:51,304 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1151 transitions. Word has length 113 [2023-11-29 01:13:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:13:51,305 INFO L495 AbstractCegarLoop]: Abstraction has 1075 states and 1151 transitions. [2023-11-29 01:13:51,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 11 states have internal predecessors, (69), 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 01:13:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1151 transitions. [2023-11-29 01:13:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 01:13:51,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:13:51,306 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 01:13:51,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 01:13:51,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2023-11-29 01:13:51,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:13:51,707 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:13:51,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:13:51,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2055656071, now seen corresponding path program 1 times [2023-11-29 01:13:51,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:13:51,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192681790] [2023-11-29 01:13:51,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:51,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:13:51,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:13:51,711 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:13:51,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:13:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:52,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 01:13:52,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:13:52,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:13:53,100 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:13:53,100 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 01:13:53,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:13:53,323 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 01:13:54,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:13:54,725 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 01:13:54,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:13:54,896 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 01:13:55,048 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:13:55,049 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 01:13:55,069 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 01:13:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:13:55,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:13:59,355 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7427 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 01:13:59,378 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7426))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7427)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:13:59,400 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7426 (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_7426))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7427)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:13:59,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7473))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7426)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7427)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:13:59,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:13:59,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192681790] [2023-11-29 01:13:59,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192681790] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:13:59,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1149888647] [2023-11-29 01:13:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:59,970 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:13:59,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:13:59,971 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:13:59,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 01:14:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:27,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 01:14:27,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:14:27,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:14:28,033 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:14:28,034 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 01:14:28,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:14:28,409 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 01:14:29,681 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:14:29,682 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 01:14:29,936 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:14:29,937 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 01:14:30,118 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:14:30,119 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 01:14:30,138 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 01:14:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:14:30,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:14:34,275 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7912 (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_7912))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7427)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:14:34,295 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7912 (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_7912))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7427)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:14:34,806 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7912 (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_7959))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7912)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7427)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:14:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1149888647] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:14:34,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:14:34,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 01:14:34,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456115149] [2023-11-29 01:14:34,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:14:34,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:14:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:14:34,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:14:34,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=306, Unknown=9, NotChecked=294, Total=702 [2023-11-29 01:14:34,813 INFO L87 Difference]: Start difference. First operand 1075 states and 1151 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 01:14:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:14:49,864 INFO L93 Difference]: Finished difference Result 1410 states and 1511 transitions. [2023-11-29 01:14:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:14:49,866 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 01:14:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:14:49,869 INFO L225 Difference]: With dead ends: 1410 [2023-11-29 01:14:49,869 INFO L226 Difference]: Without dead ends: 1410 [2023-11-29 01:14:49,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=102, Invalid=337, Unknown=9, NotChecked=308, Total=756 [2023-11-29 01:14:49,869 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 1190 mSDsluCounter, 3150 mSDsCounter, 0 mSdLazyCounter, 4139 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 4152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:14:49,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 3694 Invalid, 4152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4139 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2023-11-29 01:14:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2023-11-29 01:14:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1074. [2023-11-29 01:14:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 647 states have (on average 1.757341576506955) internal successors, (1137), 1064 states have internal predecessors, (1137), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:14:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1150 transitions. [2023-11-29 01:14:49,880 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1150 transitions. Word has length 113 [2023-11-29 01:14:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:14:49,881 INFO L495 AbstractCegarLoop]: Abstraction has 1074 states and 1150 transitions. [2023-11-29 01:14:49,881 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 01:14:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1150 transitions. [2023-11-29 01:14:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 01:14:49,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:14:49,882 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 01:14:49,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-11-29 01:14:50,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2023-11-29 01:14:50,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:14:50,282 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:14:50,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:14:50,283 INFO L85 PathProgramCache]: Analyzing trace with hash 201108824, now seen corresponding path program 1 times [2023-11-29 01:14:50,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:14:50,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813951565] [2023-11-29 01:14:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:50,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:14:50,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:14:50,284 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:14:50,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:14:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:51,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 01:14:51,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:14:51,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:14:51,625 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:14:51,625 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 01:14:51,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:14:51,821 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 01:14:53,085 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:14:53,085 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 01:14:53,244 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:14:53,244 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 01:14:53,388 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:14:53,388 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 01:14:53,537 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:14:53,537 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 01:14:53,559 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 01:14:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:14:53,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:14:53,733 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8415) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 01:14:53,751 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8415 (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_8415) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:14:53,772 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8414 (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_8414))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8415)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:14:53,793 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8414 (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_8414))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8415)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:14:53,815 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8413 (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_8413))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8414)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8415)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:14:53,839 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8413 (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_8413))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8414)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8415)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:14:54,354 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8413 (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_8461))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8413)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8414)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8415)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:14:54,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:14:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813951565] [2023-11-29 01:14:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813951565] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:14:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [17928171] [2023-11-29 01:14:54,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:54,360 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:14:54,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:14:54,361 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:14:54,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-11-29 01:15:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:30,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 01:15:30,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:15:30,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:15:31,229 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:15:31,229 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 01:15:31,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:15:31,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 01:15:32,840 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:15:32,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 01:15:33,100 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:15:33,100 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 01:15:33,276 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:15:33,277 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 01:15:33,443 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:15:33,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 01:15:33,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 27 treesize of output 15 [2023-11-29 01:15:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:15:33,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:15:33,511 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8917) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 01:15:33,530 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8917 (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_8917) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:15:33,551 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8916 (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_8916))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8917)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:15:33,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8916 (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_8916))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8917)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:15:33,596 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8915))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8916)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8917)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:15:33,621 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8915 (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_8915))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8916)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8917)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:15:34,115 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8917 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8963 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8963))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8915)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8916)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8917)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:15:34,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [17928171] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:15:34,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:15:34,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:15:34,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222072808] [2023-11-29 01:15:34,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:15:34,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:15:34,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:15:34,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:15:34,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 01:15:34,124 INFO L87 Difference]: Start difference. First operand 1074 states and 1150 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 01:15:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:15:56,463 INFO L93 Difference]: Finished difference Result 1409 states and 1510 transitions. [2023-11-29 01:15:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:15:56,465 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 01:15:56,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:15:56,466 INFO L225 Difference]: With dead ends: 1409 [2023-11-29 01:15:56,466 INFO L226 Difference]: Without dead ends: 1409 [2023-11-29 01:15:56,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=379, Unknown=14, NotChecked=742, Total=1260 [2023-11-29 01:15:56,467 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 617 mSDsluCounter, 5188 mSDsCounter, 0 mSdLazyCounter, 6608 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 5731 SdHoareTripleChecker+Invalid, 6615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 6608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:15:56,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 5731 Invalid, 6615 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 6608 Invalid, 0 Unknown, 0 Unchecked, 22.1s Time] [2023-11-29 01:15:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2023-11-29 01:15:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1073. [2023-11-29 01:15:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 647 states have (on average 1.7557959814528594) internal successors, (1136), 1063 states have internal predecessors, (1136), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:15:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1149 transitions. [2023-11-29 01:15:56,480 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1149 transitions. Word has length 115 [2023-11-29 01:15:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:15:56,480 INFO L495 AbstractCegarLoop]: Abstraction has 1073 states and 1149 transitions. [2023-11-29 01:15:56,480 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 01:15:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1149 transitions. [2023-11-29 01:15:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 01:15:56,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:15:56,481 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 01:15:56,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:15:56,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2023-11-29 01:15:56,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:15:56,882 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:15:56,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:15:56,883 INFO L85 PathProgramCache]: Analyzing trace with hash 201108825, now seen corresponding path program 1 times [2023-11-29 01:15:56,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:15:56,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783390140] [2023-11-29 01:15:56,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:56,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:15:56,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:15:56,884 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:15:56,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:15:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:58,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 01:15:58,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:15:58,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:15:58,305 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:15:58,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:15:58,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:15:58,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:15:58,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:15:58,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 01:15:58,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:15:59,675 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:15:59,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:15:59,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:15:59,866 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:15:59,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:15:59,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:16:00,019 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:16:00,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:16:00,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 [2023-11-29 01:16:00,182 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:16:00,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:16:00,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:16:00,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:16:00,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:16:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:16:00,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:16:00,524 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9467 (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_9467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (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_9467) |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_9466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:16:00,565 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_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9467) |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_9466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 01:16:00,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9465))) (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_9464) .cse0 v_ArrVal_9467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (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_9464) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9467) |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 01:16:00,861 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_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9465))) (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_9464) .cse1 v_ArrVal_9467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9464) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 01:16:01,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9463))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9465))) (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~mem40#1.base| v_ArrVal_9462) .cse0 v_ArrVal_9464) .cse1 v_ArrVal_9467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9463))) (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~mem40#1.base| v_ArrVal_9462) .cse6 v_ArrVal_9464) (select (select (store .cse7 .cse6 v_ArrVal_9465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9467))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 01:16:04,785 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_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9463))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9465))) (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_9462) .cse1 v_ArrVal_9464) .cse2 v_ArrVal_9467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9463))) (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_9462) .cse7 v_ArrVal_9464) (select (select (store .cse8 .cse7 v_ArrVal_9465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9467))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 01:16:11,214 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (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_9559))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9463))) (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_9558) .cse1 v_ArrVal_9462) .cse2 v_ArrVal_9464) (select (select (store .cse3 .cse2 v_ArrVal_9465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9467))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9464 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9466 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9559))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9463))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9465))) (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_9558) .cse6 v_ArrVal_9462) .cse7 v_ArrVal_9464) .cse8 v_ArrVal_9467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 01:16:11,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:16:11,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783390140] [2023-11-29 01:16:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783390140] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:11,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [722823658] [2023-11-29 01:16:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:11,235 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:16:11,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:16:11,236 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:16:11,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2023-11-29 01:16:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:55,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 01:16:55,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:55,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:16:57,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:16:58,004 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:16:58,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:16:58,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:16:58,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:16:59,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:16:59,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:17:03,044 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:17:03,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:17:03,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:17:03,969 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:17:03,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:17:04,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:17:04,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:17:04,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:17:04,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:17:05,289 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:17:05,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:17:05,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:17:05,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:17:05,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:17:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:17:05,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:17:05,633 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10063 (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_10063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10062 (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_10063) |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_10062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:17:05,725 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_10063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10062 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_10063) |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_10062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10063 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_10063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 01:17:05,825 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10061))) (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_10060) .cse0 v_ArrVal_10063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10060 (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_10060) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10063) |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 01:17:05,952 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_10063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_10061))) (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_10060) .cse1 v_ArrVal_10063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_10060) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_10061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 01:17:20,212 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_10059))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_10058) .cse2 v_ArrVal_10060) (select (select (store .cse3 .cse2 v_ArrVal_10061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10063))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_10059))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10061))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_10058) .cse5 v_ArrVal_10060) .cse6 v_ArrVal_10063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 01:17:27,892 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10154 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10060 (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_10154))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10059))) (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_10155) .cse1 v_ArrVal_10058) .cse2 v_ArrVal_10060) (select (select (store .cse3 .cse2 v_ArrVal_10061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10063))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10154 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10060 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10154))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10059))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10061))) (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_10155) .cse6 v_ArrVal_10058) .cse7 v_ArrVal_10060) .cse8 v_ArrVal_10063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 01:17:27,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [722823658] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:27,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:17:27,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:17:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506945917] [2023-11-29 01:17:27,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:17:27,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:17:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:17:27,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:17:27,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=388, Unknown=26, NotChecked=676, Total=1190 [2023-11-29 01:17:27,940 INFO L87 Difference]: Start difference. First operand 1073 states and 1149 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 01:19:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:19:19,043 INFO L93 Difference]: Finished difference Result 1408 states and 1509 transitions. [2023-11-29 01:19:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:19:19,046 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 01:19:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:19:19,047 INFO L225 Difference]: With dead ends: 1408 [2023-11-29 01:19:19,047 INFO L226 Difference]: Without dead ends: 1408 [2023-11-29 01:19:19,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=164, Invalid=671, Unknown=29, NotChecked=858, Total=1722 [2023-11-29 01:19:19,048 INFO L413 NwaCegarLoop]: 542 mSDtfsCounter, 627 mSDsluCounter, 3460 mSDsCounter, 0 mSdLazyCounter, 7394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 4002 SdHoareTripleChecker+Invalid, 7404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 7394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:19:19,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 4002 Invalid, 7404 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 7394 Invalid, 0 Unknown, 0 Unchecked, 103.8s Time] [2023-11-29 01:19:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2023-11-29 01:19:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1072. [2023-11-29 01:19:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 647 states have (on average 1.7542503863987635) internal successors, (1135), 1062 states have internal predecessors, (1135), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 01:19:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1148 transitions. [2023-11-29 01:19:19,061 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1148 transitions. Word has length 115 [2023-11-29 01:19:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:19:19,061 INFO L495 AbstractCegarLoop]: Abstraction has 1072 states and 1148 transitions. [2023-11-29 01:19:19,061 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 01:19:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1148 transitions. [2023-11-29 01:19:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 01:19:19,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:19:19,062 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 01:19:19,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:19:19,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2023-11-29 01:19:19,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:19:19,463 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 633 more)] === [2023-11-29 01:19:19,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:19:19,463 INFO L85 PathProgramCache]: Analyzing trace with hash -6263937, now seen corresponding path program 1 times [2023-11-29 01:19:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:19:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289686722] [2023-11-29 01:19:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:19:19,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:19:19,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:19:19,465 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:19:19,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:19:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:20,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 01:19:20,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:19:20,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:19:22,343 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:19:22,343 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 01:19:22,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:19:23,239 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 01:19:29,351 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:19:29,352 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 01:19:30,184 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:19:30,185 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 01:19:30,802 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:19:30,803 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 01:19:31,451 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:19:31,452 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 01:19:32,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:19:32,104 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 01:19:32,189 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 01:19:32,655 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:19:32,655 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 01:19:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:19:33,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:19:34,479 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10630 (_ 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_10630) (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_10629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-29 01:19:34,591 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10630 (_ BitVec 1)) (v_ArrVal_10628 (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_10630) (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_10628))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10629)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 01:19:34,698 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10630 (_ BitVec 1)) (v_ArrVal_10628 (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_10630) (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_10628))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10629)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 01:19:34,808 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10630 (_ BitVec 1)) (v_ArrVal_10627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10628 (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_10630) (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_10627))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10628)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10629)) |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 01:19:34,912 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10630 (_ BitVec 1)) (v_ArrVal_10627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10628 (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_10630) (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_10627))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10628)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10629)) |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 01:19:35,022 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10630 (_ BitVec 1)) (v_ArrVal_10627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10628 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10626 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10630) (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_10626))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10627)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10628)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10629)) |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 01:19:35,142 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10630 (_ BitVec 1)) (v_ArrVal_10627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10628 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10626 (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_10630) (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_10626))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10627)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10628)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10629)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 01:19:36,954 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10630 (_ BitVec 1)) (v_ArrVal_10676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10628 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10626 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10630) (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_10676))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10626)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10627)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10628)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10629)) |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 01:19:36,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:19:36,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289686722] [2023-11-29 01:19:36,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289686722] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:19:36,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1109771894] [2023-11-29 01:19:36,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:19:36,975 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:19:36,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:19:36,976 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:19:36,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8419e781-515f-4476-8313-3e88972b1c27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2023-11-29 01:19:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:42,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 01:19:42,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:19:42,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:19:45,936 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:19:45,937 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 01:19:46,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:19:47,860 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