./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-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_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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 b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:34:59,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:34:59,237 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 01:34:59,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:34:59,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:34:59,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:34:59,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:34:59,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:34:59,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:34:59,266 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:34:59,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:34:59,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:34:59,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:34:59,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:34:59,269 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:34:59,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:34:59,270 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:34:59,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:34:59,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:34:59,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:34:59,272 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:34:59,273 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:34:59,274 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:34:59,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:34:59,274 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:34:59,275 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:34:59,275 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:34:59,275 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:34:59,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:34:59,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:34:59,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:34:59,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:34:59,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:34:59,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:34:59,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:34:59,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:34:59,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:34:59,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:34:59,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:34:59,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:34:59,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:34:59,279 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_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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 -> b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d [2023-11-29 01:34:59,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:34:59,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:34:59,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:34:59,537 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:34:59,538 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:34:59,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2023-11-29 01:35:02,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:35:02,543 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:35:02,543 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2023-11-29 01:35:02,561 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/data/538930321/30a9da14296245169d6896714f8e3053/FLAG4d7231bcc [2023-11-29 01:35:02,577 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/data/538930321/30a9da14296245169d6896714f8e3053 [2023-11-29 01:35:02,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:35:02,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:35:02,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:35:02,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:35:02,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:35:02,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:35:02" (1/1) ... [2023-11-29 01:35:02,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e749321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:02, skipping insertion in model container [2023-11-29 01:35:02,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:35:02" (1/1) ... [2023-11-29 01:35:02,674 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:35:03,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:35:03,188 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:35:03,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1688e850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:03, skipping insertion in model container [2023-11-29 01:35:03,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:35:03,189 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 01:35:03,191 INFO L158 Benchmark]: Toolchain (without parser) took 608.91ms. Allocated memory is still 180.4MB. Free memory was 149.9MB in the beginning and 136.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:35:03,191 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:35:03,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.54ms. Allocated memory is still 180.4MB. Free memory was 149.9MB in the beginning and 136.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 01:35:03,194 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.16ms. Allocated memory is still 121.6MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.54ms. Allocated memory is still 180.4MB. Free memory was 149.9MB in the beginning and 136.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: 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_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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 b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:35:05,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:35:05,112 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 01:35:05,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:35:05,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:35:05,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:35:05,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:35:05,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:35:05,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:35:05,149 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:35:05,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:35:05,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:35:05,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:35:05,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:35:05,152 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:35:05,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:35:05,153 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:35:05,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:35:05,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:35:05,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:35:05,155 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:35:05,156 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:35:05,156 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:35:05,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:35:05,157 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:35:05,158 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:35:05,158 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:35:05,158 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:35:05,159 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:35:05,159 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:35:05,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:35:05,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:35:05,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:35:05,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:35:05,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:35:05,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:35:05,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:35:05,162 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:35:05,162 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:35:05,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:35:05,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:35:05,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:35:05,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:35:05,163 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:35:05,163 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_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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 -> b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d [2023-11-29 01:35:05,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:35:05,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:35:05,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:35:05,521 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:35:05,522 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:35:05,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2023-11-29 01:35:08,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:35:08,724 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:35:08,725 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2023-11-29 01:35:08,744 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/data/9715cc810/1a2fa07bb95e4c11aaf3350ace437cd5/FLAG23c6f4c9b [2023-11-29 01:35:08,760 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/data/9715cc810/1a2fa07bb95e4c11aaf3350ace437cd5 [2023-11-29 01:35:08,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:35:08,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:35:08,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:35:08,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:35:08,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:35:08,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:35:08" (1/1) ... [2023-11-29 01:35:08,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8a9195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:08, skipping insertion in model container [2023-11-29 01:35:08,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:35:08" (1/1) ... [2023-11-29 01:35:08,852 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:35:09,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:35:09,416 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 01:35:09,434 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:35:09,520 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:35:09,525 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:35:09,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:35:09,657 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:35:09,665 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:35:09,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09 WrapperNode [2023-11-29 01:35:09,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:35:09,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:35:09,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:35:09,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:35:09,674 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:35:09" (1/1) ... [2023-11-29 01:35:09,707 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:35:09" (1/1) ... [2023-11-29 01:35:09,763 INFO L138 Inliner]: procedures = 180, calls = 350, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1184 [2023-11-29 01:35:09,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:35:09,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:35:09,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:35:09,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:35:09,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09" (1/1) ... [2023-11-29 01:35:09,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09" (1/1) ... [2023-11-29 01:35:09,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09" (1/1) ... [2023-11-29 01:35:09,904 INFO L175 MemorySlicer]: Split 309 memory accesses to 4 slices as follows [2, 34, 5, 268]. 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:35:09,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09" (1/1) ... [2023-11-29 01:35:09,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09" (1/1) ... [2023-11-29 01:35:09,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09" (1/1) ... [2023-11-29 01:35:09,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09" (1/1) ... [2023-11-29 01:35:09,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09" (1/1) ... [2023-11-29 01:35:09,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09" (1/1) ... [2023-11-29 01:35:10,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:35:10,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:35:10,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:35:10,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:35:10,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09" (1/1) ... [2023-11-29 01:35:10,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:35:10,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:35:10,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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:35:10,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/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:35:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 01:35:10,077 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 01:35:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 01:35:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 01:35:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 01:35:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 01:35:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 01:35:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 01:35:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 01:35:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 01:35:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 01:35:10,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 01:35:10,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 01:35:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 01:35:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 01:35:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 01:35:10,080 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 01:35:10,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 01:35:10,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 01:35:10,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 01:35:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2023-11-29 01:35:10,081 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2023-11-29 01:35:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:35:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:35:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:35:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:35:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:35:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 01:35:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:35:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 01:35:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:35:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:35:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:35:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 01:35:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:35:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 01:35:10,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 01:35:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 01:35:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 01:35:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:35:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:35:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 01:35:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 01:35:10,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:35:10,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:35:10,317 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:35:10,319 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:35:10,342 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:35:10,377 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:35:10,400 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:35:10,422 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:35:15,595 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:35:15,773 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:35:15,773 INFO L309 CfgBuilder]: Removed 71 assume(true) statements. [2023-11-29 01:35:15,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:35:15 BoogieIcfgContainer [2023-11-29 01:35:15,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:35:15,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:35:15,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:35:15,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:35:15,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:35:08" (1/3) ... [2023-11-29 01:35:15,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b14fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:35:15, skipping insertion in model container [2023-11-29 01:35:15,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:09" (2/3) ... [2023-11-29 01:35:15,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b14fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:35:15, skipping insertion in model container [2023-11-29 01:35:15,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:35:15" (3/3) ... [2023-11-29 01:35:15,784 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test8-2.i [2023-11-29 01:35:15,805 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:35:15,805 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 640 error locations. [2023-11-29 01:35:15,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:35:15,879 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;@2987453c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:35:15,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 640 error locations. [2023-11-29 01:35:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 1187 states, 523 states have (on average 2.5181644359464626) internal successors, (1317), 1177 states have internal predecessors, (1317), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 01:35:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 01:35:15,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:15,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 01:35:15,895 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:15,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:15,923 INFO L85 PathProgramCache]: Analyzing trace with hash 71041, now seen corresponding path program 1 times [2023-11-29 01:35:15,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:15,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681551411] [2023-11-29 01:35:15,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:15,937 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:35:15,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:15,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:15,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:16,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:35:16,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:16,260 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:35:16,275 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:35:16,275 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:16,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:16,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681551411] [2023-11-29 01:35:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681551411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:16,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:16,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:35:16,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324154337] [2023-11-29 01:35:16,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:16,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:16,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:16,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:16,320 INFO L87 Difference]: Start difference. First operand has 1187 states, 523 states have (on average 2.5181644359464626) internal successors, (1317), 1177 states have internal predecessors, (1317), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:20,711 INFO L93 Difference]: Finished difference Result 1724 states and 1862 transitions. [2023-11-29 01:35:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 01:35:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:20,741 INFO L225 Difference]: With dead ends: 1724 [2023-11-29 01:35:20,742 INFO L226 Difference]: Without dead ends: 1723 [2023-11-29 01:35:20,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:20,747 INFO L413 NwaCegarLoop]: 915 mSDtfsCounter, 588 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:20,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1554 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-11-29 01:35:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2023-11-29 01:35:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1348. [2023-11-29 01:35:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 691 states have (on average 2.345875542691751) internal successors, (1621), 1337 states have internal predecessors, (1621), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 01:35:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1665 transitions. [2023-11-29 01:35:20,850 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1665 transitions. Word has length 2 [2023-11-29 01:35:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:20,850 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1665 transitions. [2023-11-29 01:35:20,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1665 transitions. [2023-11-29 01:35:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 01:35:20,851 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:20,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 01:35:20,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:21,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:21,052 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:21,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash 71040, now seen corresponding path program 1 times [2023-11-29 01:35:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:21,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368258904] [2023-11-29 01:35:21,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:21,054 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:35:21,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:21,055 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:21,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:21,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:35:21,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:21,168 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:35:21,175 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:35:21,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:21,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368258904] [2023-11-29 01:35:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368258904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:21,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:21,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:35:21,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185638012] [2023-11-29 01:35:21,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:21,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:21,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:21,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:21,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:21,179 INFO L87 Difference]: Start difference. First operand 1348 states and 1665 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:23,639 INFO L93 Difference]: Finished difference Result 1533 states and 1859 transitions. [2023-11-29 01:35:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:23,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 01:35:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:23,647 INFO L225 Difference]: With dead ends: 1533 [2023-11-29 01:35:23,647 INFO L226 Difference]: Without dead ends: 1533 [2023-11-29 01:35:23,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:23,649 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 1061 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:23,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 904 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 01:35:23,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2023-11-29 01:35:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1351. [2023-11-29 01:35:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 702 states have (on average 2.3133903133903133) internal successors, (1624), 1339 states have internal predecessors, (1624), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 01:35:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1670 transitions. [2023-11-29 01:35:23,685 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1670 transitions. Word has length 2 [2023-11-29 01:35:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:23,685 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 1670 transitions. [2023-11-29 01:35:23,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1670 transitions. [2023-11-29 01:35:23,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 01:35:23,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:23,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 01:35:23,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:23,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:23,888 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:23,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1186062026, now seen corresponding path program 1 times [2023-11-29 01:35:23,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:23,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457018174] [2023-11-29 01:35:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:23,889 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:35:23,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:23,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:23,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:24,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:35:24,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:24,055 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:35:24,065 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:35:24,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:35:24,135 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:35:24,157 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:35:24,157 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:35:24,179 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:35:24,179 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:24,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:24,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457018174] [2023-11-29 01:35:24,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457018174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:24,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:24,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:35:24,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697333218] [2023-11-29 01:35:24,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:24,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:35:24,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:24,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:35:24,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:24,183 INFO L87 Difference]: Start difference. First operand 1351 states and 1670 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:27,929 INFO L93 Difference]: Finished difference Result 1522 states and 1848 transitions. [2023-11-29 01:35:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:35:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 01:35:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:27,938 INFO L225 Difference]: With dead ends: 1522 [2023-11-29 01:35:27,938 INFO L226 Difference]: Without dead ends: 1522 [2023-11-29 01:35:27,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:27,940 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 2386 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:27,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 512 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 01:35:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2023-11-29 01:35:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1167. [2023-11-29 01:35:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 529 states have (on average 2.3137996219281662) internal successors, (1224), 1156 states have internal predecessors, (1224), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 01:35:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1268 transitions. [2023-11-29 01:35:27,977 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1268 transitions. Word has length 6 [2023-11-29 01:35:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:27,977 INFO L495 AbstractCegarLoop]: Abstraction has 1167 states and 1268 transitions. [2023-11-29 01:35:27,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1268 transitions. [2023-11-29 01:35:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 01:35:27,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:27,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:27,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:28,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:28,183 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:28,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:28,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1886782754, now seen corresponding path program 1 times [2023-11-29 01:35:28,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:28,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966021492] [2023-11-29 01:35:28,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:28,184 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:35:28,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:28,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:28,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:28,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:35:28,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:28,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:35:28,334 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:35:28,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:28,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966021492] [2023-11-29 01:35:28,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966021492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:28,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:28,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:35:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421950126] [2023-11-29 01:35:28,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:28,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:28,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:28,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:28,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:28,336 INFO L87 Difference]: Start difference. First operand 1167 states and 1268 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:30,841 INFO L93 Difference]: Finished difference Result 1463 states and 1592 transitions. [2023-11-29 01:35:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:30,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 01:35:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:30,849 INFO L225 Difference]: With dead ends: 1463 [2023-11-29 01:35:30,850 INFO L226 Difference]: Without dead ends: 1463 [2023-11-29 01:35:30,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:30,850 INFO L413 NwaCegarLoop]: 1009 mSDtfsCounter, 895 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:30,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1370 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 01:35:30,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2023-11-29 01:35:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1120. [2023-11-29 01:35:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 529 states have (on average 2.223062381852552) internal successors, (1176), 1109 states have internal predecessors, (1176), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-29 01:35:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1220 transitions. [2023-11-29 01:35:30,876 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1220 transitions. Word has length 7 [2023-11-29 01:35:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:30,876 INFO L495 AbstractCegarLoop]: Abstraction has 1120 states and 1220 transitions. [2023-11-29 01:35:30,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1220 transitions. [2023-11-29 01:35:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 01:35:30,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:30,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:30,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:31,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:31,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:31,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:31,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1886782753, now seen corresponding path program 1 times [2023-11-29 01:35:31,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:31,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423790904] [2023-11-29 01:35:31,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:31,081 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:35:31,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:31,082 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:31,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:31,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:35:31,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:31,219 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:35:31,245 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:35:31,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:31,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:31,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423790904] [2023-11-29 01:35:31,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423790904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:31,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:31,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:35:31,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540393746] [2023-11-29 01:35:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:31,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:31,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:31,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:31,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:31,248 INFO L87 Difference]: Start difference. First operand 1120 states and 1220 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:34,763 INFO L93 Difference]: Finished difference Result 1546 states and 1681 transitions. [2023-11-29 01:35:34,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:34,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 01:35:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:34,774 INFO L225 Difference]: With dead ends: 1546 [2023-11-29 01:35:34,774 INFO L226 Difference]: Without dead ends: 1546 [2023-11-29 01:35:34,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:34,775 INFO L413 NwaCegarLoop]: 1190 mSDtfsCounter, 624 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:34,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1690 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-29 01:35:34,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2023-11-29 01:35:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1322. [2023-11-29 01:35:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 739 states have (on average 2.205683355886333) internal successors, (1630), 1309 states have internal predecessors, (1630), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 01:35:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1678 transitions. [2023-11-29 01:35:34,810 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1678 transitions. Word has length 7 [2023-11-29 01:35:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:34,811 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1678 transitions. [2023-11-29 01:35:34,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1678 transitions. [2023-11-29 01:35:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 01:35:34,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:34,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:34,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:35,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:35,014 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr533REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:35,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:35,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1379275429, now seen corresponding path program 1 times [2023-11-29 01:35:35,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:35,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393438684] [2023-11-29 01:35:35,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:35,015 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:35:35,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:35,016 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:35,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:35,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:35:35,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:35,193 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:35:35,193 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:35,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:35,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393438684] [2023-11-29 01:35:35,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393438684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:35,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:35,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:35:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346489677] [2023-11-29 01:35:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:35,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:35,195 INFO L87 Difference]: Start difference. First operand 1322 states and 1678 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:36,782 INFO L93 Difference]: Finished difference Result 2056 states and 2631 transitions. [2023-11-29 01:35:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:36,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 01:35:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:36,793 INFO L225 Difference]: With dead ends: 2056 [2023-11-29 01:35:36,793 INFO L226 Difference]: Without dead ends: 2056 [2023-11-29 01:35:36,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:36,794 INFO L413 NwaCegarLoop]: 1173 mSDtfsCounter, 683 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:36,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 2082 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 01:35:36,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2023-11-29 01:35:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 1657. [2023-11-29 01:35:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1072 states have (on average 2.183768656716418) internal successors, (2341), 1642 states have internal predecessors, (2341), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 01:35:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2393 transitions. [2023-11-29 01:35:36,831 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2393 transitions. Word has length 10 [2023-11-29 01:35:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:36,831 INFO L495 AbstractCegarLoop]: Abstraction has 1657 states and 2393 transitions. [2023-11-29 01:35:36,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2393 transitions. [2023-11-29 01:35:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:35:36,832 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:36,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:36,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-29 01:35:37,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:37,033 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr344REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:37,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1068672755, now seen corresponding path program 1 times [2023-11-29 01:35:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114125509] [2023-11-29 01:35:37,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:37,034 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:35:37,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:37,035 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:37,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:37,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:35:37,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:37,165 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:35:37,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:37,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:37,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114125509] [2023-11-29 01:35:37,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114125509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:37,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:37,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:35:37,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305635956] [2023-11-29 01:35:37,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:37,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:37,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:37,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:37,168 INFO L87 Difference]: Start difference. First operand 1657 states and 2393 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:38,185 INFO L93 Difference]: Finished difference Result 1573 states and 2233 transitions. [2023-11-29 01:35:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:38,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 01:35:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:38,196 INFO L225 Difference]: With dead ends: 1573 [2023-11-29 01:35:38,196 INFO L226 Difference]: Without dead ends: 1573 [2023-11-29 01:35:38,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:38,197 INFO L413 NwaCegarLoop]: 1024 mSDtfsCounter, 70 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:38,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1999 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 01:35:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2023-11-29 01:35:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2023-11-29 01:35:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1012 states have (on average 2.1551383399209487) internal successors, (2181), 1558 states have internal predecessors, (2181), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 01:35:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2233 transitions. [2023-11-29 01:35:38,235 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2233 transitions. Word has length 12 [2023-11-29 01:35:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:38,235 INFO L495 AbstractCegarLoop]: Abstraction has 1573 states and 2233 transitions. [2023-11-29 01:35:38,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2233 transitions. [2023-11-29 01:35:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:35:38,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:38,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:38,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:38,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:38,437 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr535REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:38,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash -34685049, now seen corresponding path program 1 times [2023-11-29 01:35:38,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:38,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249197269] [2023-11-29 01:35:38,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:38,438 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:35:38,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:38,439 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:38,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:38,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:35:38,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:38,639 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:35:38,639 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:38,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:38,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249197269] [2023-11-29 01:35:38,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249197269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:38,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:38,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:35:38,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591031503] [2023-11-29 01:35:38,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:38,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:35:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:38,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:35:38,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:35:38,641 INFO L87 Difference]: Start difference. First operand 1573 states and 2233 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:41,441 INFO L93 Difference]: Finished difference Result 1953 states and 2475 transitions. [2023-11-29 01:35:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:35:41,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 01:35:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:41,450 INFO L225 Difference]: With dead ends: 1953 [2023-11-29 01:35:41,450 INFO L226 Difference]: Without dead ends: 1953 [2023-11-29 01:35:41,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:35:41,451 INFO L413 NwaCegarLoop]: 1155 mSDtfsCounter, 660 mSDsluCounter, 2929 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 4084 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:41,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 4084 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 01:35:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2023-11-29 01:35:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1575. [2023-11-29 01:35:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1014 states have (on average 2.1528599605522682) internal successors, (2183), 1560 states have internal predecessors, (2183), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 01:35:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2235 transitions. [2023-11-29 01:35:41,480 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2235 transitions. Word has length 13 [2023-11-29 01:35:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:41,480 INFO L495 AbstractCegarLoop]: Abstraction has 1575 states and 2235 transitions. [2023-11-29 01:35:41,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2235 transitions. [2023-11-29 01:35:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:35:41,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:41,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:41,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:41,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:41,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr638ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:41,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash -34678139, now seen corresponding path program 1 times [2023-11-29 01:35:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:41,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282777024] [2023-11-29 01:35:41,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:41,683 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:35:41,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:41,683 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:41,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:41,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:35:41,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:41,848 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:35:41,849 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:35:41,850 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:35:41,854 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:35:41,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:35:41,940 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:35:41,955 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:35:41,956 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:41,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282777024] [2023-11-29 01:35:41,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282777024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:41,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:41,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:35:41,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721082818] [2023-11-29 01:35:41,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:41,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:35:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:41,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:35:41,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:41,958 INFO L87 Difference]: Start difference. First operand 1575 states and 2235 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:44,114 INFO L93 Difference]: Finished difference Result 2786 states and 3850 transitions. [2023-11-29 01:35:44,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:35:44,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 01:35:44,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:44,126 INFO L225 Difference]: With dead ends: 2786 [2023-11-29 01:35:44,127 INFO L226 Difference]: Without dead ends: 2786 [2023-11-29 01:35:44,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:35:44,127 INFO L413 NwaCegarLoop]: 1025 mSDtfsCounter, 1028 mSDsluCounter, 2042 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:44,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 3067 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 01:35:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2023-11-29 01:35:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 1574. [2023-11-29 01:35:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1013 states have (on average 2.153010858835143) internal successors, (2181), 1559 states have internal predecessors, (2181), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 01:35:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2233 transitions. [2023-11-29 01:35:44,178 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2233 transitions. Word has length 13 [2023-11-29 01:35:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:44,179 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 2233 transitions. [2023-11-29 01:35:44,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2233 transitions. [2023-11-29 01:35:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 01:35:44,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:44,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:44,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:44,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:44,380 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:44,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1441026091, now seen corresponding path program 1 times [2023-11-29 01:35:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:44,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99962872] [2023-11-29 01:35:44,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:44,382 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:35:44,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:44,383 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:44,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:44,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:35:44,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:44,599 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:35:44,599 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:44,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:44,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99962872] [2023-11-29 01:35:44,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99962872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:44,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:44,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:35:44,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539198824] [2023-11-29 01:35:44,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:44,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:44,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:44,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:44,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:44,601 INFO L87 Difference]: Start difference. First operand 1574 states and 2233 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:45,527 INFO L93 Difference]: Finished difference Result 1520 states and 2153 transitions. [2023-11-29 01:35:45,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:45,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 01:35:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:45,535 INFO L225 Difference]: With dead ends: 1520 [2023-11-29 01:35:45,536 INFO L226 Difference]: Without dead ends: 1520 [2023-11-29 01:35:45,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:45,536 INFO L413 NwaCegarLoop]: 987 mSDtfsCounter, 70 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:45,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1925 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:35:45,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2023-11-29 01:35:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520. [2023-11-29 01:35:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 983 states have (on average 2.1373346897253307) internal successors, (2101), 1505 states have internal predecessors, (2101), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 01:35:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2153 transitions. [2023-11-29 01:35:45,560 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2153 transitions. Word has length 15 [2023-11-29 01:35:45,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:45,560 INFO L495 AbstractCegarLoop]: Abstraction has 1520 states and 2153 transitions. [2023-11-29 01:35:45,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2153 transitions. [2023-11-29 01:35:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 01:35:45,561 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:45,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:45,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:45,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:45,761 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:45,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1846603601, now seen corresponding path program 1 times [2023-11-29 01:35:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:45,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779617107] [2023-11-29 01:35:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:45,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:35:45,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:45,764 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:45,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:45,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:35:45,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:45,949 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:35:45,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:45,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779617107] [2023-11-29 01:35:45,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779617107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:45,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:45,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:35:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036047183] [2023-11-29 01:35:45,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:45,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:35:45,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:45,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:35:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:45,951 INFO L87 Difference]: Start difference. First operand 1520 states and 2153 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:47,020 INFO L93 Difference]: Finished difference Result 1506 states and 2111 transitions. [2023-11-29 01:35:47,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:35:47,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 01:35:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:47,028 INFO L225 Difference]: With dead ends: 1506 [2023-11-29 01:35:47,028 INFO L226 Difference]: Without dead ends: 1506 [2023-11-29 01:35:47,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:35:47,029 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 58 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2844 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:47,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2844 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 01:35:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2023-11-29 01:35:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1504. [2023-11-29 01:35:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 981 states have (on average 2.09683995922528) internal successors, (2057), 1489 states have internal predecessors, (2057), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 01:35:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2109 transitions. [2023-11-29 01:35:47,053 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2109 transitions. Word has length 17 [2023-11-29 01:35:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:47,053 INFO L495 AbstractCegarLoop]: Abstraction has 1504 states and 2109 transitions. [2023-11-29 01:35:47,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2109 transitions. [2023-11-29 01:35:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 01:35:47,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:47,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:47,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:47,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:47,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:47,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:47,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1743907683, now seen corresponding path program 1 times [2023-11-29 01:35:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:47,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906656325] [2023-11-29 01:35:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:47,256 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:35:47,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:47,257 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:47,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:47,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:35:47,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:47,431 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:35:47,501 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:35:47,502 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:47,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:47,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906656325] [2023-11-29 01:35:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906656325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:47,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:47,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:35:47,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044522842] [2023-11-29 01:35:47,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:47,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:35:47,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:47,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:35:47,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:47,503 INFO L87 Difference]: Start difference. First operand 1504 states and 2109 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:49,772 INFO L93 Difference]: Finished difference Result 1514 states and 2117 transitions. [2023-11-29 01:35:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:35:49,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 01:35:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:49,781 INFO L225 Difference]: With dead ends: 1514 [2023-11-29 01:35:49,781 INFO L226 Difference]: Without dead ends: 1514 [2023-11-29 01:35:49,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:35:49,782 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 788 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:49,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1296 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 01:35:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2023-11-29 01:35:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1500. [2023-11-29 01:35:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 981 states have (on average 2.08868501529052) internal successors, (2049), 1485 states have internal predecessors, (2049), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 01:35:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2101 transitions. [2023-11-29 01:35:49,810 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2101 transitions. Word has length 31 [2023-11-29 01:35:49,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:49,810 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 2101 transitions. [2023-11-29 01:35:49,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:49,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2101 transitions. [2023-11-29 01:35:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 01:35:49,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:49,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:49,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:50,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:50,012 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:50,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:50,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1743907682, now seen corresponding path program 1 times [2023-11-29 01:35:50,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:50,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771532159] [2023-11-29 01:35:50,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:50,013 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:35:50,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:50,013 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:50,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:50,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:35:50,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:50,181 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:35:50,350 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:35:50,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:50,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:50,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771532159] [2023-11-29 01:35:50,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771532159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:50,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:50,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:35:50,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166187490] [2023-11-29 01:35:50,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:50,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:35:50,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:50,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:35:50,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:50,352 INFO L87 Difference]: Start difference. First operand 1500 states and 2101 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:54,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:54,609 INFO L93 Difference]: Finished difference Result 1697 states and 2097 transitions. [2023-11-29 01:35:54,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:35:54,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 01:35:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:54,618 INFO L225 Difference]: With dead ends: 1697 [2023-11-29 01:35:54,618 INFO L226 Difference]: Without dead ends: 1697 [2023-11-29 01:35:54,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:35:54,619 INFO L413 NwaCegarLoop]: 1170 mSDtfsCounter, 519 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:54,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2395 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 01:35:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2023-11-29 01:35:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1496. [2023-11-29 01:35:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 981 states have (on average 2.0805300713557595) internal successors, (2041), 1481 states have internal predecessors, (2041), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 01:35:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2093 transitions. [2023-11-29 01:35:54,638 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2093 transitions. Word has length 31 [2023-11-29 01:35:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:54,638 INFO L495 AbstractCegarLoop]: Abstraction has 1496 states and 2093 transitions. [2023-11-29 01:35:54,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2093 transitions. [2023-11-29 01:35:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 01:35:54,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:54,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:54,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 01:35:54,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:54,841 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:54,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1245945326, now seen corresponding path program 1 times [2023-11-29 01:35:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:54,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422117072] [2023-11-29 01:35:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:54,842 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:35:54,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:54,843 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:54,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:55,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:35:55,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:55,097 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:35:55,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:55,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:55,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422117072] [2023-11-29 01:35:55,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422117072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:55,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:55,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:35:55,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178796303] [2023-11-29 01:35:55,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:55,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:35:55,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:55,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:35:55,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:55,099 INFO L87 Difference]: Start difference. First operand 1496 states and 2093 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:56,269 INFO L93 Difference]: Finished difference Result 1484 states and 2073 transitions. [2023-11-29 01:35:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:35:56,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-29 01:35:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:56,279 INFO L225 Difference]: With dead ends: 1484 [2023-11-29 01:35:56,279 INFO L226 Difference]: Without dead ends: 1484 [2023-11-29 01:35:56,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:35:56,280 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 23 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2830 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:56,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2830 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 01:35:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2023-11-29 01:35:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1484. [2023-11-29 01:35:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 969 states have (on average 2.085655314757482) internal successors, (2021), 1469 states have internal predecessors, (2021), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 01:35:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 2073 transitions. [2023-11-29 01:35:56,299 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 2073 transitions. Word has length 50 [2023-11-29 01:35:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:56,299 INFO L495 AbstractCegarLoop]: Abstraction has 1484 states and 2073 transitions. [2023-11-29 01:35:56,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2073 transitions. [2023-11-29 01:35:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 01:35:56,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:56,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:56,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:56,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:56,502 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:35:56,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1302219504, now seen corresponding path program 1 times [2023-11-29 01:35:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:35:56,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991552703] [2023-11-29 01:35:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:56,503 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:35:56,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:35:56,504 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:56,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:56,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:35:56,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:56,891 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:35:56,900 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:35:57,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:35:57,426 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:35:57,439 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:35:57,439 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:35:57,448 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:35:57,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:35:57,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:35:57,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991552703] [2023-11-29 01:35:57,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991552703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:57,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:35:57,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295038136] [2023-11-29 01:35:57,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:57,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:35:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:35:57,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:35:57,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:57,451 INFO L87 Difference]: Start difference. First operand 1484 states and 2073 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:35:59,894 INFO L93 Difference]: Finished difference Result 1457 states and 2047 transitions. [2023-11-29 01:35:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:35:59,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 01:35:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:35:59,903 INFO L225 Difference]: With dead ends: 1457 [2023-11-29 01:35:59,904 INFO L226 Difference]: Without dead ends: 1457 [2023-11-29 01:35:59,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:59,904 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 1389 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:35:59,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 635 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 01:35:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2023-11-29 01:35:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1131. [2023-11-29 01:35:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 659 states have (on average 1.9817905918057663) internal successors, (1306), 1119 states have internal predecessors, (1306), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 01:35:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1352 transitions. [2023-11-29 01:35:59,927 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1352 transitions. Word has length 54 [2023-11-29 01:35:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:35:59,927 INFO L495 AbstractCegarLoop]: Abstraction has 1131 states and 1352 transitions. [2023-11-29 01:35:59,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1352 transitions. [2023-11-29 01:35:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:35:59,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:35:59,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:59,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:00,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:36:00,129 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:36:00,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:00,130 INFO L85 PathProgramCache]: Analyzing trace with hash -830805638, now seen corresponding path program 1 times [2023-11-29 01:36:00,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:36:00,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624846530] [2023-11-29 01:36:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:00,130 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:36:00,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:36:00,131 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:00,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:00,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:36:00,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:00,402 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:36:00,415 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:36:00,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 01:36:00,449 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:36:00,449 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:36:00,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:36:00,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624846530] [2023-11-29 01:36:00,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624846530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:00,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:00,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:36:00,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389360657] [2023-11-29 01:36:00,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:00,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:36:00,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:36:00,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:36:00,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:36:00,451 INFO L87 Difference]: Start difference. First operand 1131 states and 1352 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:36:03,818 INFO L93 Difference]: Finished difference Result 1130 states and 1351 transitions. [2023-11-29 01:36:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:36:03,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-11-29 01:36:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:36:03,823 INFO L225 Difference]: With dead ends: 1130 [2023-11-29 01:36:03,823 INFO L226 Difference]: Without dead ends: 1130 [2023-11-29 01:36:03,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:36:03,824 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 3 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:36:03,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2468 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 01:36:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2023-11-29 01:36:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2023-11-29 01:36:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 659 states have (on average 1.9802731411229135) internal successors, (1305), 1118 states have internal predecessors, (1305), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 01:36:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1351 transitions. [2023-11-29 01:36:03,841 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1351 transitions. Word has length 58 [2023-11-29 01:36:03,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:36:03,841 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1351 transitions. [2023-11-29 01:36:03,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1351 transitions. [2023-11-29 01:36:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:36:03,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:36:03,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:03,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:04,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:36:04,043 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:36:04,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:04,043 INFO L85 PathProgramCache]: Analyzing trace with hash -830805637, now seen corresponding path program 1 times [2023-11-29 01:36:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:36:04,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747327944] [2023-11-29 01:36:04,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:04,044 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:36:04,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:36:04,045 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:04,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:04,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 01:36:04,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:04,323 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:36:04,346 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:36:04,353 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:36:04,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 01:36:04,405 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:36:04,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:36:04,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:36:04,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747327944] [2023-11-29 01:36:04,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747327944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:04,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:04,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:36:04,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086843035] [2023-11-29 01:36:04,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:04,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:36:04,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:36:04,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:36:04,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:36:04,407 INFO L87 Difference]: Start difference. First operand 1130 states and 1351 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:36:08,525 INFO L93 Difference]: Finished difference Result 1129 states and 1350 transitions. [2023-11-29 01:36:08,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:36:08,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-11-29 01:36:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:36:08,529 INFO L225 Difference]: With dead ends: 1129 [2023-11-29 01:36:08,530 INFO L226 Difference]: Without dead ends: 1129 [2023-11-29 01:36:08,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:36:08,530 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 1 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2527 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:36:08,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2527 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 01:36:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2023-11-29 01:36:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2023-11-29 01:36:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 658 states have (on average 1.9817629179331306) internal successors, (1304), 1117 states have internal predecessors, (1304), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 01:36:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1350 transitions. [2023-11-29 01:36:08,544 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1350 transitions. Word has length 58 [2023-11-29 01:36:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:36:08,544 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 1350 transitions. [2023-11-29 01:36:08,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:08,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1350 transitions. [2023-11-29 01:36:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 01:36:08,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:36:08,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:08,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:08,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:36:08,746 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:36:08,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2133917282, now seen corresponding path program 1 times [2023-11-29 01:36:08,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:36:08,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465060653] [2023-11-29 01:36:08,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:08,747 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:36:08,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:36:08,748 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:08,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:09,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:36:09,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:09,036 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:36:09,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:36:09,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:36:09,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465060653] [2023-11-29 01:36:09,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465060653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:09,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:09,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:36:09,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652806535] [2023-11-29 01:36:09,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:09,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:36:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:36:09,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:36:09,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:36:09,039 INFO L87 Difference]: Start difference. First operand 1129 states and 1350 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:36:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:36:10,213 INFO L93 Difference]: Finished difference Result 1131 states and 1353 transitions. [2023-11-29 01:36:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:36:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2023-11-29 01:36:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:36:10,219 INFO L225 Difference]: With dead ends: 1131 [2023-11-29 01:36:10,219 INFO L226 Difference]: Without dead ends: 1131 [2023-11-29 01:36:10,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:36:10,220 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 1 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:36:10,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2763 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 01:36:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2023-11-29 01:36:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1131. [2023-11-29 01:36:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 659 states have (on average 1.9817905918057663) internal successors, (1306), 1119 states have internal predecessors, (1306), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:36:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1353 transitions. [2023-11-29 01:36:10,243 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1353 transitions. Word has length 64 [2023-11-29 01:36:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:36:10,243 INFO L495 AbstractCegarLoop]: Abstraction has 1131 states and 1353 transitions. [2023-11-29 01:36:10,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:36:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1353 transitions. [2023-11-29 01:36:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 01:36:10,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:36:10,244 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:36:10,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:10,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:36:10,445 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:36:10,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:10,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1710379576, now seen corresponding path program 1 times [2023-11-29 01:36:10,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:36:10,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023908579] [2023-11-29 01:36:10,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:10,446 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:36:10,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:36:10,447 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:10,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:10,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:36:10,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:10,755 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:36:10,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:36:10,821 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:36:10,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:36:10,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023908579] [2023-11-29 01:36:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023908579] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:36:10,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:36:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 01:36:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67102401] [2023-11-29 01:36:10,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:36:10,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:36:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:36:10,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:36:10,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:36:10,823 INFO L87 Difference]: Start difference. First operand 1131 states and 1353 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:36:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:36:12,804 INFO L93 Difference]: Finished difference Result 1140 states and 1367 transitions. [2023-11-29 01:36:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:36:12,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-11-29 01:36:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:36:12,809 INFO L225 Difference]: With dead ends: 1140 [2023-11-29 01:36:12,809 INFO L226 Difference]: Without dead ends: 1140 [2023-11-29 01:36:12,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:36:12,810 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 6 mSDsluCounter, 4595 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5516 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:36:12,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5516 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 01:36:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2023-11-29 01:36:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1139. [2023-11-29 01:36:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 666 states have (on average 1.9804804804804805) internal successors, (1319), 1126 states have internal predecessors, (1319), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:36:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1366 transitions. [2023-11-29 01:36:12,828 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1366 transitions. Word has length 65 [2023-11-29 01:36:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:36:12,828 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1366 transitions. [2023-11-29 01:36:12,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:36:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1366 transitions. [2023-11-29 01:36:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 01:36:12,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:36:12,829 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:12,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:13,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:36:13,030 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:36:13,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash 825080862, now seen corresponding path program 2 times [2023-11-29 01:36:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:36:13,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427694161] [2023-11-29 01:36:13,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:36:13,031 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:36:13,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:36:13,032 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:13,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:13,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:36:13,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:36:13,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:36:13,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:13,614 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:36:13,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:36:13,762 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:36:13,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:36:13,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427694161] [2023-11-29 01:36:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427694161] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:36:13,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:36:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 01:36:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614694111] [2023-11-29 01:36:13,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:36:13,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:36:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:36:13,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:36:13,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:36:13,765 INFO L87 Difference]: Start difference. First operand 1139 states and 1366 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:36:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:36:16,267 INFO L93 Difference]: Finished difference Result 1154 states and 1388 transitions. [2023-11-29 01:36:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:36:16,268 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2023-11-29 01:36:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:36:16,269 INFO L225 Difference]: With dead ends: 1154 [2023-11-29 01:36:16,269 INFO L226 Difference]: Without dead ends: 1152 [2023-11-29 01:36:16,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 01:36:16,270 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 13 mSDsluCounter, 4600 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5521 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:36:16,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5521 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 01:36:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2023-11-29 01:36:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1148. [2023-11-29 01:36:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 675 states have (on average 1.9718518518518517) internal successors, (1331), 1135 states have internal predecessors, (1331), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:36:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1378 transitions. [2023-11-29 01:36:16,290 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1378 transitions. Word has length 68 [2023-11-29 01:36:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:36:16,291 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1378 transitions. [2023-11-29 01:36:16,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:36:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1378 transitions. [2023-11-29 01:36:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 01:36:16,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:36:16,292 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:16,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:16,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:36:16,493 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:36:16,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash -397968418, now seen corresponding path program 3 times [2023-11-29 01:36:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:36:16,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303428158] [2023-11-29 01:36:16,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:36:16,494 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:36:16,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:36:16,495 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:16,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:17,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 01:36:17,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:36:17,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 01:36:17,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:17,448 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:36:17,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:36:18,037 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:36:18,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:36:18,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303428158] [2023-11-29 01:36:18,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303428158] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:36:18,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:36:18,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 01:36:18,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735839445] [2023-11-29 01:36:18,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:36:18,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 01:36:18,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:36:18,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 01:36:18,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 01:36:18,039 INFO L87 Difference]: Start difference. First operand 1148 states and 1378 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:36:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:36:24,545 INFO L93 Difference]: Finished difference Result 1178 states and 1428 transitions. [2023-11-29 01:36:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 01:36:24,546 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2023-11-29 01:36:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:36:24,549 INFO L225 Difference]: With dead ends: 1178 [2023-11-29 01:36:24,549 INFO L226 Difference]: Without dead ends: 1175 [2023-11-29 01:36:24,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 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:36:24,551 INFO L413 NwaCegarLoop]: 920 mSDtfsCounter, 24 mSDsluCounter, 11942 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12862 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:36:24,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12862 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-11-29 01:36:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2023-11-29 01:36:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1166. [2023-11-29 01:36:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 693 states have (on average 1.953823953823954) internal successors, (1354), 1153 states have internal predecessors, (1354), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:36:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1401 transitions. [2023-11-29 01:36:24,574 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1401 transitions. Word has length 74 [2023-11-29 01:36:24,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:36:24,574 INFO L495 AbstractCegarLoop]: Abstraction has 1166 states and 1401 transitions. [2023-11-29 01:36:24,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:36:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1401 transitions. [2023-11-29 01:36:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 01:36:24,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:36:24,575 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:24,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 01:36:24,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:36:24,775 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:36:24,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:24,776 INFO L85 PathProgramCache]: Analyzing trace with hash 423267166, now seen corresponding path program 4 times [2023-11-29 01:36:24,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:36:24,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000665450] [2023-11-29 01:36:24,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:36:24,777 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:36:24,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:36:24,778 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:24,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:25,122 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:36:25,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:36:25,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 01:36:25,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:25,563 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:36:25,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:36:27,098 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:36:27,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:36:27,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000665450] [2023-11-29 01:36:27,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000665450] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:36:27,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:36:27,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 01:36:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735511642] [2023-11-29 01:36:27,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:36:27,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 01:36:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:36:27,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 01:36:27,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 01:36:27,102 INFO L87 Difference]: Start difference. First operand 1166 states and 1401 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:36:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:36:42,050 INFO L93 Difference]: Finished difference Result 1223 states and 1490 transitions. [2023-11-29 01:36:42,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 01:36:42,051 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2023-11-29 01:36:42,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:36:42,054 INFO L225 Difference]: With dead ends: 1223 [2023-11-29 01:36:42,054 INFO L226 Difference]: Without dead ends: 1221 [2023-11-29 01:36:42,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 01:36:42,059 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 47 mSDsluCounter, 21160 mSDsCounter, 0 mSdLazyCounter, 4913 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 22081 SdHoareTripleChecker+Invalid, 4961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:36:42,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 22081 Invalid, 4961 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 4913 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2023-11-29 01:36:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2023-11-29 01:36:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1200. [2023-11-29 01:36:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 727 states have (on average 1.9257221458046767) internal successors, (1400), 1187 states have internal predecessors, (1400), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:36:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1447 transitions. [2023-11-29 01:36:42,075 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1447 transitions. Word has length 86 [2023-11-29 01:36:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:36:42,075 INFO L495 AbstractCegarLoop]: Abstraction has 1200 states and 1447 transitions. [2023-11-29 01:36:42,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:36:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1447 transitions. [2023-11-29 01:36:42,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 01:36:42,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:36:42,084 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:42,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:42,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:36:42,284 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:36:42,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash -274971362, now seen corresponding path program 5 times [2023-11-29 01:36:42,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:36:42,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490620696] [2023-11-29 01:36:42,286 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:36:42,286 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:36:42,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:36:42,287 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:42,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:43,818 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 01:36:43,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:36:43,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 01:36:43,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:43,862 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:36:43,981 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:36:43,981 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:36:44,024 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:36:44,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 01:36:45,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:36:45,113 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:36:45,160 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:36:45,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:36:45,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:36:45,624 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2022 (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_2022) |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:36:45,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:36:45,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490620696] [2023-11-29 01:36:45,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490620696] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:36:45,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [492212729] [2023-11-29 01:36:45,628 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:36:45,628 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:36:45,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:36:45,629 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:36:45,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 01:38:03,697 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 01:38:03,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:38:03,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 01:38:03,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:38:03,940 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:38:04,197 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:38:04,197 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:38:04,259 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:38:04,382 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:38:05,197 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:38:05,197 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:38:05,268 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:38:05,278 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:38:05,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:38:05,670 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2484) |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:38:05,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [492212729] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:38:05,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:38:05,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 01:38:05,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038863309] [2023-11-29 01:38:05,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:38:05,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:38:05,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:38:05,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:38:05,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=163, Unknown=2, NotChecked=54, Total=272 [2023-11-29 01:38:05,674 INFO L87 Difference]: Start difference. First operand 1200 states and 1447 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:38:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:38:14,334 INFO L93 Difference]: Finished difference Result 1578 states and 1946 transitions. [2023-11-29 01:38:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:38:14,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 01:38:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:38:14,338 INFO L225 Difference]: With dead ends: 1578 [2023-11-29 01:38:14,338 INFO L226 Difference]: Without dead ends: 1576 [2023-11-29 01:38:14,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=184, Unknown=2, NotChecked=58, Total=306 [2023-11-29 01:38:14,338 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 1623 mSDsluCounter, 3512 mSDsCounter, 0 mSdLazyCounter, 4272 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 4134 SdHoareTripleChecker+Invalid, 4286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:38:14,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 4134 Invalid, 4286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4272 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-11-29 01:38:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2023-11-29 01:38:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1199. [2023-11-29 01:38:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 727 states have (on average 1.9188445667125171) internal successors, (1395), 1186 states have internal predecessors, (1395), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:38:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1442 transitions. [2023-11-29 01:38:14,352 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1442 transitions. Word has length 108 [2023-11-29 01:38:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:38:14,353 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1442 transitions. [2023-11-29 01:38:14,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:38:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1442 transitions. [2023-11-29 01:38:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 01:38:14,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:38:14,354 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:38:14,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 01:38:14,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 01:38:14,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:38:14,754 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:38:14,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:38:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash -274971361, now seen corresponding path program 1 times [2023-11-29 01:38:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:38:14,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153622009] [2023-11-29 01:38:14,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:14,755 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:38:14,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:38:14,756 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:38:14,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:38:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:38:15,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-29 01:38:15,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:38:15,473 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:38:15,556 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:38:15,567 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:38:15,567 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:38:15,591 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:38:15,601 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:38:15,698 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:38:15,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 9 treesize of output 3 [2023-11-29 01:38:16,393 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:38:16,393 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:38:16,405 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:38:16,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:38:16,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:38:16,462 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:38:16,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:38:17,663 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3037 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:38:17,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:38:17,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153622009] [2023-11-29 01:38:17,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153622009] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:38:17,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1145863547] [2023-11-29 01:38:17,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:38:17,670 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:38:17,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:38:17,671 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:38:17,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 01:40:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:02,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 01:40:02,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:40:02,358 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:40:02,606 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:40:02,606 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:40:02,611 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:40:02,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:40:02,669 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:40:02,799 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:40:02,802 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:40:03,433 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:40:03,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:40:03,440 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:40:03,520 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:40:03,525 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:40:03,529 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:40:03,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:40:04,779 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3591 (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_3592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3591) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:40:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1145863547] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:40:04,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:40:04,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 01:40:04,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833972820] [2023-11-29 01:40:04,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:40:04,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:40:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:40:04,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:40:04,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 01:40:04,793 INFO L87 Difference]: Start difference. First operand 1199 states and 1442 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:40:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:40:12,276 INFO L93 Difference]: Finished difference Result 1575 states and 1941 transitions. [2023-11-29 01:40:12,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:40:12,277 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 01:40:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:40:12,280 INFO L225 Difference]: With dead ends: 1575 [2023-11-29 01:40:12,280 INFO L226 Difference]: Without dead ends: 1575 [2023-11-29 01:40:12,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-11-29 01:40:12,280 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 1639 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 3518 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:40:12,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 2391 Invalid, 3537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3518 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-11-29 01:40:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2023-11-29 01:40:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1198. [2023-11-29 01:40:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 727 states have (on average 1.9174690508940853) internal successors, (1394), 1185 states have internal predecessors, (1394), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:40:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1441 transitions. [2023-11-29 01:40:12,304 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1441 transitions. Word has length 108 [2023-11-29 01:40:12,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:40:12,305 INFO L495 AbstractCegarLoop]: Abstraction has 1198 states and 1441 transitions. [2023-11-29 01:40:12,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:40:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1441 transitions. [2023-11-29 01:40:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 01:40:12,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:40:12,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] [2023-11-29 01:40:12,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:12,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 01:40:12,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:40:12,707 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:40:12,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:40:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2042149390, now seen corresponding path program 1 times [2023-11-29 01:40:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:40:12,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105969128] [2023-11-29 01:40:12,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:12,708 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:40:12,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:40:12,709 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:12,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:13,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 01:40:13,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:40:13,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:40:13,555 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:40:13,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:40:13,587 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:40:13,664 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:40:14,418 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:40:14,418 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:40:14,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:40:14,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:40:14,527 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:40:14,557 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:40:14,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:40:14,603 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4015 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4015) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2023-11-29 01:40:14,611 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4015 (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_4015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 01:40:14,928 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4015 (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~mem38#1.base| v_ArrVal_4061))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4015)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:40:14,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:40:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105969128] [2023-11-29 01:40:14,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105969128] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:40:14,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1242264490] [2023-11-29 01:40:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:14,931 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:40:14,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:40:14,932 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:40:14,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 01:40:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:18,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 01:40:18,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:40:18,290 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:40:18,545 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:40:18,545 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:40:18,601 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:40:18,734 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:40:19,407 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:40:19,407 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:40:19,536 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:40:19,536 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:40:19,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 01:40:19,558 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:40:19,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:40:19,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4484) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2023-11-29 01:40:19,581 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4484 (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_4484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:40:19,952 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4530))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4484)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:40:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1242264490] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:40:19,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:40:19,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 01:40:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906729202] [2023-11-29 01:40:19,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:40:19,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 01:40:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:40:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:40:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=216, Unknown=6, NotChecked=210, Total=506 [2023-11-29 01:40:19,956 INFO L87 Difference]: Start difference. First operand 1198 states and 1441 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:40:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:40:26,182 INFO L93 Difference]: Finished difference Result 1574 states and 1940 transitions. [2023-11-29 01:40:26,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:40:26,184 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 01:40:26,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:40:26,187 INFO L225 Difference]: With dead ends: 1574 [2023-11-29 01:40:26,187 INFO L226 Difference]: Without dead ends: 1574 [2023-11-29 01:40:26,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=241, Unknown=6, NotChecked=222, Total=552 [2023-11-29 01:40:26,188 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 1618 mSDsluCounter, 2335 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1623 SdHoareTripleChecker+Valid, 2956 SdHoareTripleChecker+Invalid, 2977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:40:26,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1623 Valid, 2956 Invalid, 2977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2964 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-11-29 01:40:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2023-11-29 01:40:26,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1197. [2023-11-29 01:40:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 727 states have (on average 1.9160935350756534) internal successors, (1393), 1184 states have internal predecessors, (1393), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:40:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1440 transitions. [2023-11-29 01:40:26,201 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1440 transitions. Word has length 110 [2023-11-29 01:40:26,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:40:26,201 INFO L495 AbstractCegarLoop]: Abstraction has 1197 states and 1440 transitions. [2023-11-29 01:40:26,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:40:26,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1440 transitions. [2023-11-29 01:40:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 01:40:26,202 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:40:26,202 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:40:26,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 01:40:26,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:26,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:40:26,603 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:40:26,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:40:26,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2042149391, now seen corresponding path program 1 times [2023-11-29 01:40:26,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:40:26,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850621377] [2023-11-29 01:40:26,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:26,604 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:40:26,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:40:26,605 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:26,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:27,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 01:40:27,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:40:27,442 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:40:27,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:40:27,521 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:40:27,521 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:40:27,539 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:40:27,547 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:40:27,625 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:40:27,629 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:40:28,242 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:40:28,242 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:40:28,251 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:40:28,357 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:40:28,357 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:40:28,366 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:40:28,382 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:40:28,388 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:40:28,412 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:40:28,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:40:28,565 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5000 (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_4999) |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_5000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4999 (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_4999) |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:40:28,597 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_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_4999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_4999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:40:29,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_5091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4999 (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_5091) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5092))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5091) .cse2 v_ArrVal_4999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:40:29,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:40:29,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850621377] [2023-11-29 01:40:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850621377] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:40:29,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1056719745] [2023-11-29 01:40:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:29,944 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:40:29,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:40:29,945 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:40:29,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 01:40:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:33,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 01:40:33,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:40:33,379 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:40:33,588 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:40:33,588 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:40:33,596 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:40:33,648 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:40:33,666 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:40:33,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:40:33,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:40:34,339 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:40:34,339 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:40:34,344 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:40:34,494 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:40:34,495 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:40:34,503 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:40:34,515 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:40:34,521 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:40:34,522 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:40:34,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:40:34,569 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5562 (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_5562) |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_5561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5562 (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_5562) |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:40:34,600 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_5562 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5562 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:40:35,904 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5562 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5654))) (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~mem38#1.base| v_ArrVal_5653) .cse0 v_ArrVal_5562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5562 (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_5653) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-11-29 01:40:35,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1056719745] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:40:35,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:40:35,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 01:40:35,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043577629] [2023-11-29 01:40:35,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:40:35,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 01:40:35,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:40:35,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:40:35,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 01:40:35,915 INFO L87 Difference]: Start difference. First operand 1197 states and 1440 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:40:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:40:46,649 INFO L93 Difference]: Finished difference Result 1573 states and 1939 transitions. [2023-11-29 01:40:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:40:46,650 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 01:40:46,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:40:46,653 INFO L225 Difference]: With dead ends: 1573 [2023-11-29 01:40:46,653 INFO L226 Difference]: Without dead ends: 1573 [2023-11-29 01:40:46,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 01:40:46,654 INFO L413 NwaCegarLoop]: 620 mSDtfsCounter, 1016 mSDsluCounter, 3017 mSDsCounter, 0 mSdLazyCounter, 5660 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 3637 SdHoareTripleChecker+Invalid, 5671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:40:46,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 3637 Invalid, 5671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 5660 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2023-11-29 01:40:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2023-11-29 01:40:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1196. [2023-11-29 01:40:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 727 states have (on average 1.9147180192572215) internal successors, (1392), 1183 states have internal predecessors, (1392), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:40:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1439 transitions. [2023-11-29 01:40:46,672 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1439 transitions. Word has length 110 [2023-11-29 01:40:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:40:46,672 INFO L495 AbstractCegarLoop]: Abstraction has 1196 states and 1439 transitions. [2023-11-29 01:40:46,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:40:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1439 transitions. [2023-11-29 01:40:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 01:40:46,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:40:46,673 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:40:46,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-11-29 01:40:46,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:47,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:40:47,074 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:40:47,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:40:47,074 INFO L85 PathProgramCache]: Analyzing trace with hash -292840104, now seen corresponding path program 1 times [2023-11-29 01:40:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:40:47,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465812512] [2023-11-29 01:40:47,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:47,075 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:40:47,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:40:47,076 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:47,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:40:48,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 01:40:48,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:40:48,048 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:40:48,147 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:40:48,147 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:40:48,178 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:40:48,245 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:40:49,042 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:40:49,042 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:40:49,145 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:40:49,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:40:49,220 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:40:49,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:40:49,233 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:40:49,271 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:40:49,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:40:49,323 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6093 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6093) |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:40:49,333 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6093 (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_6093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:40:49,345 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6093 (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_6092))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6093)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:40:49,763 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6139))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6092)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6093)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:40:49,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:40:49,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465812512] [2023-11-29 01:40:49,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465812512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:40:49,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [89316113] [2023-11-29 01:40:49,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:40:49,768 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:40:49,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:40:49,768 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:40:49,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 01:41:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:20,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 01:41:20,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:41:20,794 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:41:21,055 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:41:21,056 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:41:21,112 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:41:21,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 01:41:22,007 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:41:22,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 01:41:22,167 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:41:22,167 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:41:22,261 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:41:22,261 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:41:22,277 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:41:22,286 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:41:22,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:41:22,300 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6579) |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:41:22,311 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6579 (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_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:41:22,418 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (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_6578))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:41:22,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [89316113] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:41:22,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:41:22,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 01:41:22,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723430037] [2023-11-29 01:41:22,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:41:22,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:41:22,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:41:22,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:41:22,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=366, Unknown=17, NotChecked=322, Total=812 [2023-11-29 01:41:22,887 INFO L87 Difference]: Start difference. First operand 1196 states and 1439 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:41:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:41:32,793 INFO L93 Difference]: Finished difference Result 1572 states and 1938 transitions. [2023-11-29 01:41:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:41:32,795 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-11-29 01:41:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:41:32,797 INFO L225 Difference]: With dead ends: 1572 [2023-11-29 01:41:32,797 INFO L226 Difference]: Without dead ends: 1572 [2023-11-29 01:41:32,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=400, Unknown=17, NotChecked=336, Total=870 [2023-11-29 01:41:32,798 INFO L413 NwaCegarLoop]: 620 mSDtfsCounter, 1606 mSDsluCounter, 4670 mSDsCounter, 0 mSdLazyCounter, 5472 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 5290 SdHoareTripleChecker+Invalid, 5486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:41:32,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 5290 Invalid, 5486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 5472 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2023-11-29 01:41:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2023-11-29 01:41:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1195. [2023-11-29 01:41:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 727 states have (on average 1.9133425034387896) internal successors, (1391), 1182 states have internal predecessors, (1391), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:41:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1438 transitions. [2023-11-29 01:41:32,810 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1438 transitions. Word has length 112 [2023-11-29 01:41:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:41:32,810 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1438 transitions. [2023-11-29 01:41:32,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:41:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1438 transitions. [2023-11-29 01:41:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 01:41:32,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:41:32,811 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:41:32,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 01:41:33,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:41:33,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:41:33,211 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:41:33,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:41:33,212 INFO L85 PathProgramCache]: Analyzing trace with hash -292840103, now seen corresponding path program 1 times [2023-11-29 01:41:33,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:41:33,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445565865] [2023-11-29 01:41:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:41:33,213 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:41:33,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:41:33,213 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:41:33,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:41:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:34,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 01:41:34,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:41:34,214 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:41:34,302 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:41:34,311 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:41:34,312 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:41:34,331 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:41:34,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:41:34,415 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:41:34,419 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:41:34,972 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:41:34,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:41:34,982 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:41:35,070 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:41:35,070 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:41:35,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:41:35,148 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:41:35,148 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:41:35,155 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:41:35,176 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:41:35,182 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:41:35,204 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:41:35,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:41:35,335 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7112) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 01:41:35,366 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_7111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7111) |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_7112) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:41:35,454 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7109))) (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_7110) .cse0 v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7112) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7111 (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_7110) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7111) |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:41:35,544 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_7110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7110) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7109))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7110) .cse3 v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7112) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:41:37,849 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7111 (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_7203))) (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_7204) .cse1 v_ArrVal_7110) (select (select (store .cse2 .cse1 v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7111))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7203))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7109))) (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_7204) .cse4 v_ArrVal_7110) .cse5 v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7112) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:41:37,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:41:37,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445565865] [2023-11-29 01:41:37,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445565865] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:41:37,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [809939719] [2023-11-29 01:41:37,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:41:37,864 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:41:37,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:41:37,865 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:41:37,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 01:42:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:10,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 01:42:10,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:42:10,588 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:42:11,008 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:42:11,030 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:42:11,031 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:42:11,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 11 treesize of output 7 [2023-11-29 01:42:11,145 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:42:11,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:42:11,391 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:42:12,287 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:42:12,287 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:42:12,298 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:42:12,542 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:42:12,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:42:12,556 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:42:12,696 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:42:12,697 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:42:12,709 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:42:12,731 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:42:12,737 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:42:12,742 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:42:12,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:42:12,798 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7692 (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_7692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7691 (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_7692) |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_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:42:12,834 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_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 01:42:12,874 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7690) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7689) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7689))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7690) .cse2 v_ArrVal_7692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:42:12,922 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_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7689))) (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_7690) .cse1 v_ArrVal_7692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7690) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7689) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 01:42:14,398 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7783 (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_7783))) (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_7784) .cse1 v_ArrVal_7690) (select (select (store .cse2 .cse1 v_ArrVal_7689) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7692))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7783))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7689))) (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_7784) .cse4 v_ArrVal_7690) .cse5 v_ArrVal_7692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:42:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [809939719] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:42:14,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:42:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 01:42:14,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020618859] [2023-11-29 01:42:14,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:42:14,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:42:14,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:42:14,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:42:14,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 01:42:14,414 INFO L87 Difference]: Start difference. First operand 1195 states and 1438 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:42:36,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:42:36,722 INFO L93 Difference]: Finished difference Result 1571 states and 1937 transitions. [2023-11-29 01:42:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:42:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-11-29 01:42:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:42:36,729 INFO L225 Difference]: With dead ends: 1571 [2023-11-29 01:42:36,729 INFO L226 Difference]: Without dead ends: 1571 [2023-11-29 01:42:36,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 01:42:36,730 INFO L413 NwaCegarLoop]: 620 mSDtfsCounter, 1624 mSDsluCounter, 3868 mSDsCounter, 0 mSdLazyCounter, 7580 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 4488 SdHoareTripleChecker+Invalid, 7598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 7580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:42:36,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 4488 Invalid, 7598 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 7580 Invalid, 0 Unknown, 0 Unchecked, 21.8s Time] [2023-11-29 01:42:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2023-11-29 01:42:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1194. [2023-11-29 01:42:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 727 states have (on average 1.9119669876203575) internal successors, (1390), 1181 states have internal predecessors, (1390), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:42:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1437 transitions. [2023-11-29 01:42:36,747 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1437 transitions. Word has length 112 [2023-11-29 01:42:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:42:36,747 INFO L495 AbstractCegarLoop]: Abstraction has 1194 states and 1437 transitions. [2023-11-29 01:42:36,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:42:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1437 transitions. [2023-11-29 01:42:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:42:36,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:42:36,748 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:42:36,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:42:36,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 01:42:37,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:42:37,149 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:42:37,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:42:37,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2050146428, now seen corresponding path program 1 times [2023-11-29 01:42:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:42:37,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068973020] [2023-11-29 01:42:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:37,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:42:37,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:42:37,151 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:42:37,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:42:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:42:38,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 01:42:38,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:42:38,413 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:42:38,635 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:42:38,635 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:42:38,677 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:42:38,801 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:42:39,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:42:39,929 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:42:40,064 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:42:40,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:42:40,171 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:42:40,171 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:42:40,308 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:42:40,308 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:42:40,327 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:42:40,393 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:42:40,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:42:40,483 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8239 (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_8239) |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:42:40,499 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8239 (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_8239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:42:40,518 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8238 (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_8238))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8239)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:42:40,537 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8238 (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_8238))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8239)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:42:40,558 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8237 (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_8237))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8238)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8239)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:42:40,581 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8237 (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_8237))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8238)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8239)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:42:41,060 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8237 (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_8285))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8237)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8238)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8239)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:42:41,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:42:41,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068973020] [2023-11-29 01:42:41,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068973020] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:42:41,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [923974081] [2023-11-29 01:42:41,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:42:41,066 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:42:41,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:42:41,067 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:42:41,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 01:43:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:21,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 01:43:21,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:21,029 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:43:21,500 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:43:21,500 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:43:21,594 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:43:21,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 01:43:22,851 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:43:22,852 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:43:23,072 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:43:23,073 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:43:23,232 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:43:23,232 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:43:23,381 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:43:23,381 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:43:23,399 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:43:23,413 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:43:23,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:43:27,533 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8741 (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_8741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:43:27,551 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (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_8740))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8741)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:43:27,570 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8740))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8741)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:43:27,590 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (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_8739))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8740)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8741)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:43:27,610 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (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_8739))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8740)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8741)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:43:28,079 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8787))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8739)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8740)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8741)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:43:28,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [923974081] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:43:28,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:43:28,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:43:28,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362759521] [2023-11-29 01:43:28,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:43:28,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:43:28,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:28,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:43:28,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=381, Unknown=15, NotChecked=676, Total=1190 [2023-11-29 01:43:28,086 INFO L87 Difference]: Start difference. First operand 1194 states and 1437 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:43:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:41,958 INFO L93 Difference]: Finished difference Result 1570 states and 1936 transitions. [2023-11-29 01:43:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:43:41,960 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2023-11-29 01:43:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:41,962 INFO L225 Difference]: With dead ends: 1570 [2023-11-29 01:43:41,962 INFO L226 Difference]: Without dead ends: 1570 [2023-11-29 01:43:41,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=127, Invalid=416, Unknown=15, NotChecked=702, Total=1260 [2023-11-29 01:43:41,963 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 995 mSDsluCounter, 4000 mSDsCounter, 0 mSdLazyCounter, 4692 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 4619 SdHoareTripleChecker+Invalid, 4700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:41,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 4619 Invalid, 4700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 4692 Invalid, 0 Unknown, 0 Unchecked, 13.7s Time] [2023-11-29 01:43:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2023-11-29 01:43:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1193. [2023-11-29 01:43:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 727 states have (on average 1.9105914718019257) internal successors, (1389), 1180 states have internal predecessors, (1389), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:43:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1436 transitions. [2023-11-29 01:43:41,976 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1436 transitions. Word has length 114 [2023-11-29 01:43:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:41,976 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1436 transitions. [2023-11-29 01:43:41,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:43:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1436 transitions. [2023-11-29 01:43:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:43:41,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:41,977 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:41,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:43:42,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 01:43:42,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:43:42,377 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:43:42,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:42,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2050146429, now seen corresponding path program 1 times [2023-11-29 01:43:42,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:42,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136727880] [2023-11-29 01:43:42,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:42,378 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:43:42,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:42,379 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:43:42,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:43:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:43,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 01:43:43,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:43,627 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:43:43,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:43:43,824 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:43:43,825 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:43:43,864 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:43:43,879 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:43:44,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 01:43:44,006 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:43:44,930 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:43:44,930 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:43:44,938 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:43:45,090 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:43:45,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:43:45,108 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:43:45,247 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:43:45,248 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:43:45,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:43:45,386 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:43:45,387 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:43:45,393 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:43:45,418 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:43:45,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 9 treesize of output 3 [2023-11-29 01:43:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:43:45,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:43:45,664 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9290 (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_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (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_9290) |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_9291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:43:45,708 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_9290 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:43:45,761 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9289) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9288))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9289) .cse2 v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:43:45,819 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_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9289) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9288))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9289) .cse3 v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:43:46,670 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9286))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9288))) (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_9287) .cse0 v_ArrVal_9289) .cse1 v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (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_9286))) (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_9287) .cse6 v_ArrVal_9289) (select (select (store .cse7 .cse6 v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9290))) |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:43:48,194 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_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9286))) (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_9287) .cse2 v_ArrVal_9289) (select (select (store .cse3 .cse2 v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9290))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9286))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9288))) (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_9287) .cse5 v_ArrVal_9289) .cse6 v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 01:43:54,001 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9382 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9383))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9286))) (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_9382) .cse1 v_ArrVal_9287) .cse2 v_ArrVal_9289) (select (select (store .cse3 .cse2 v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9290))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9382 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9383))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9286))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9288))) (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_9382) .cse6 v_ArrVal_9287) .cse7 v_ArrVal_9289) .cse8 v_ArrVal_9290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9291) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 01:43:54,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136727880] [2023-11-29 01:43:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136727880] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:43:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [526086228] [2023-11-29 01:43:54,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:54,037 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:43:54,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:43:54,038 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:43:54,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 01:44:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:44:39,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-29 01:44:39,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:44:39,132 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:44:41,944 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:44:41,945 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:44:41,995 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:44:42,443 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:44:42,495 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:44:43,789 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:44:43,816 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:44:48,680 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:44:48,681 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:44:48,757 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:44:49,911 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:44:49,911 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:44:49,988 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:44:50,763 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:44:50,764 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:44:50,841 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:44:51,667 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:44:51,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:44:51,742 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:44:51,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:44:51,848 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:44:51,874 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:44:51,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:44:52,090 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9888 (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_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (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_9888) |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_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:44:52,212 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_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9888) |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_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9888) |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:44:52,346 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9885))) (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_9886) .cse0 v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (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_9886) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9888) |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:44:52,477 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_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9886) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9885))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9886) .cse3 v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:44:52,631 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9883))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9885))) (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_9884) .cse0 v_ArrVal_9886) .cse1 v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (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_9883))) (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_9884) .cse6 v_ArrVal_9886) (select (select (store .cse7 .cse6 v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9888))) |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:44:52,775 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_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9883))) (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_9884) .cse2 v_ArrVal_9886) (select (select (store .cse3 .cse2 v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9888))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9883))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9885))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9884) .cse5 v_ArrVal_9886) .cse6 v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 01:45:00,862 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9980))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9883))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9885))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9979) .cse0 v_ArrVal_9884) .cse1 v_ArrVal_9886) .cse2 v_ArrVal_9888) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9887) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9980 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9979 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9980))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9883))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9979) .cse8 v_ArrVal_9884) .cse9 v_ArrVal_9886) (select (select (store .cse10 .cse9 v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9888))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 01:45:00,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [526086228] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:45:00,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:45:00,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:45:00,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471371991] [2023-11-29 01:45:00,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:45:00,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:45:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:45:00,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:45:00,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 01:45:00,906 INFO L87 Difference]: Start difference. First operand 1193 states and 1436 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:47:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:11,717 INFO L93 Difference]: Finished difference Result 1569 states and 1935 transitions. [2023-11-29 01:47:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:47:11,720 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2023-11-29 01:47:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:11,722 INFO L225 Difference]: With dead ends: 1569 [2023-11-29 01:47:11,723 INFO L226 Difference]: Without dead ends: 1569 [2023-11-29 01:47:11,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=161, Invalid=637, Unknown=14, NotChecked=910, Total=1722 [2023-11-29 01:47:11,724 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 1621 mSDsluCounter, 3874 mSDsCounter, 0 mSdLazyCounter, 7586 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 125.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 4493 SdHoareTripleChecker+Invalid, 7606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 128.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:11,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 4493 Invalid, 7606 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 7586 Invalid, 0 Unknown, 0 Unchecked, 128.1s Time] [2023-11-29 01:47:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2023-11-29 01:47:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1192. [2023-11-29 01:47:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 727 states have (on average 1.9092159559834938) internal successors, (1388), 1179 states have internal predecessors, (1388), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2023-11-29 01:47:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1435 transitions. [2023-11-29 01:47:11,736 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1435 transitions. Word has length 114 [2023-11-29 01:47:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:11,737 INFO L495 AbstractCegarLoop]: Abstraction has 1192 states and 1435 transitions. [2023-11-29 01:47:11,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:47:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1435 transitions. [2023-11-29 01:47:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 01:47:11,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:11,737 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] [2023-11-29 01:47:11,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 01:47:11,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:47:12,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:47:12,138 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 637 more)] === [2023-11-29 01:47:12,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1197579933, now seen corresponding path program 1 times [2023-11-29 01:47:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:47:12,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578528277] [2023-11-29 01:47:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:12,139 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:47:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:47:12,140 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:47:12,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:47:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:13,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 01:47:13,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:13,555 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:47:15,483 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:47:15,484 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:47:15,852 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:47:16,626 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:47:24,394 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:47:24,394 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:47:25,474 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:47:25,474 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:47:26,263 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:47:26,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:47:27,084 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:47:27,084 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:47:27,941 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:47:27,942 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:47:28,044 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:47:28,421 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 01:47:28,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-11-29 01:47:28,907 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:47:28,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:47:29,796 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10453 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10453) |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:47:29,878 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10453 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_10453) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:47:29,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10453 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_10452))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10453)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:47:30,047 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10453 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_10452))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10453)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:47:30,137 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10453 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_10451))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10452)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10453)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:47:30,229 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10453 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_10451))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10452)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10453)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:47:30,324 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10453 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_10450))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10451)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10452)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10453)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:47:30,428 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10453 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_10450))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10451)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10452)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10453)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:47:32,508 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10500 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_10500))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10451)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10452)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10453)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:47:32,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:47:32,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578528277] [2023-11-29 01:47:32,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578528277] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:32,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [176165985] [2023-11-29 01:47:32,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:32,532 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:47:32,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:47:32,532 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:47:32,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4b8366a-10b7-4a9c-aecf-f6bbce8811e1/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 01:47:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 01:47:41,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:41,271 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:47:45,028 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:47:45,028 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:47:45,710 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:47:47,260 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:47:57,089 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:47:57,089 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:47:58,788 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:47:58,788 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:47:59,802 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:47:59,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 36 treesize of output 35 [2023-11-29 01:48:00,961 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:48:00,962 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:48:02,029 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:48:02,029 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:48:02,198 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:48:02,793 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:48:02,794 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:48:03,128 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:48:03,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:48:08,752 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10974 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10974) (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_10973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))) is different from false [2023-11-29 01:48:08,873 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10974 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10974) (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_10972))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10973)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 01:48:08,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10974 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10974) (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_10972))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10973)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 01:48:09,123 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10974 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10974) (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_10971))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10972)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10973)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))))) is different from false [2023-11-29 01:48:09,252 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10974 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10974) (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_10971))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10972)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10973)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 01:48:09,385 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10974 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10974) (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_10970))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10971)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10972)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10973)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))))) is different from false [2023-11-29 01:48:09,520 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10974 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10974) (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_10970))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10971)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10972)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10973)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 01:48:12,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [176165985] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:48:12,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:48:12,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 01:48:12,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839447919] [2023-11-29 01:48:12,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:48:12,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 01:48:12,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:48:12,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 01:48:12,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=635, Unknown=21, NotChecked=1072, Total=1892 [2023-11-29 01:48:12,421 INFO L87 Difference]: Start difference. First operand 1192 states and 1435 transitions. Second operand has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)